Sciweavers

317 search results - page 28 / 64
» Reasoning about the Implementation of Concurrency Abstractio...
Sort
View
TGC
2007
Springer
15 years 5 months ago
Computational Soundness of Equational Theories (Tutorial)
Abstract. We study the link between formal and cryptographic models for security protocols in the presence of passive and adaptive adversaries. We first describe the seminal resul...
Steve Kremer
CL
2000
Springer
15 years 4 months ago
Dominance Constraints with Set Operators
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
Denys Duchier, Joachim Niehren
SFP
2004
15 years 1 months ago
Generic proofs for combinator-based generic programs
Abstract: Generic programming can bring important benefits to software engineering. In particular, it reduces the burden of verification, since generic proofs can be instantiated a...
Fermín Reig
DEON
2004
Springer
15 years 5 months ago
On Obligations and Abilities
Abstract. In this paper, we combine deontic logic with Alternatingtime Temporal Logic (ATL) into a framework that makes it possible to model and reason about obligations and abilit...
Wojciech Jamroga, Wiebe van der Hoek, Michael Wool...
87
Voted
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
14 years 9 months ago
Efficient Detection of Errors in Java Components Using Random Environment and Restarts
Software model checkers are being used mostly to discover specific types of errors in the code, since exhaustive verification of complex programs is not possible due to state explo...
Pavel Parizek, Tomás Kalibera