Games, Automata, Logic, and Formal Verification (GandALF 2011)

Automata , Games , and Verification

Design and formal verification of DZMBE+

In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...

The Gandalf speaker verification database

The Gandalf speech database has been designed for use in research on automatic speaker verification. 86 customer speakers and 100 impostor speakers have been recorded in up to 24 telephone calls per speaker during a period of up to 12 months. In addition to speech files, Gandalf includes a relational database with a twofold function: it stores information on subjects and calls, and it is a tool...

Formal Verification using Parity Games

While many problems can be reduced to solving parity games, see [FL10] for example, verification frameworks using parity game solvers as a backend technology seem quite unexplored. In this abstract we report an initial attempt at building an infrastructure for a verification framework, which so far captures model checking for the modal μ-calculus. At least two toolsets, mCRL2 and LTSmin, reduce...

?Logic and Formal Ontology: Is the Final Formal Ontology Possible

Musa Akrami AbstractMany philosophers and logicians have contemplated the relationship between ontology and logic. The author of this paper, working within a Bolzanoan-Husserlian tradition of studying both ontology and logic, considers ontology as the science of the most general features of beings and the most general relations among them. He considers logic as the science concernin...