Sciweavers

114 search results - page 12 / 23
» Formal compiler construction in a logical framework
Sort
View
CCS
2005
ACM
14 years 1 months ago
Towards computationally sound symbolic analysis of key exchange protocols
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
Prateek Gupta, Vitaly Shmatikov
EPIA
2005
Springer
14 years 1 months ago
Intentions and Strategies in Game-Like Scenarios
In this paper, we investigate the link between logics of games and “mentalistic” logics of rational agency, in which agents are characterized in terms of attitudes such as beli...
Wojciech Jamroga, Wiebe van der Hoek, Michael Wool...
JAR
2000
77views more  JAR 2000»
13 years 7 months ago
Proving Consistency Assertions for Automotive Product Data Management
We present a formal specification and verification approach for industrial product data bases containing Boolean logic formulae to express constraints. Within this framework, globa...
Wolfgang Küchlin, Carsten Sinz
PPDP
2009
Springer
14 years 2 months ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus
WADT
2004
Springer
14 years 27 days ago
Type Class Polymorphism in an Institutional Framework
Higher-order logic with shallow type class polymorphism is widely used as a specification formalism. Its polymorphic entities (types, operators, axioms) can easily be equipped wit...
Lutz Schröder, Till Mossakowski, Christoph L&...