Sciweavers

374 search results - page 61 / 75
» Using Language Inference to Verify Omega-Regular Properties
Sort
View
CADE
2007
Springer
15 years 10 months ago
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
Andrei Voronkov, Juan Antonio Navarro Pérez
ICFEM
2004
Springer
15 years 3 months ago
Timed Patterns: TCOZ to Timed Automata
Abstract. The integrated logic-based modeling language, Timed Communicating Object Z (TCOZ), is well suited for presenting complete and coherent requirement models for complex real...
Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun 00...
HASKELL
2006
ACM
15 years 3 months ago
Running the manual: an approach to high-assurance microkernel development
We propose a development methodology for designing and prototyping high assurance microkernels, and describe our application of it. The methodology is based on rapid prototyping a...
Philip Derrin, Kevin Elphinstone, Gerwin Klein, Da...
CDC
2008
IEEE
180views Control Systems» more  CDC 2008»
15 years 4 months ago
Opacity-enforcing supervisory strategies for secure discrete event systems
— Initial-state opacity emerges as a key property in numerous security applications of discrete event systems including key-stream generators for cryptographic protocols. Speciļ¬...
Anooshiravan Saboori, Christoforos N. Hadjicostis
PROVSEC
2007
Springer
15 years 3 months ago
Formal Proof of Provable Security by Game-Playing in a Proof Assistant
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
Reynald Affeldt, Miki Tanaka, Nicolas Marti