Sciweavers

155 search results - page 27 / 31
» Compositional Predicate Abstraction from Game Semantics
Sort
View
FMSD
2006
183views more  FMSD 2006»
13 years 6 months ago
An algebraic theory for behavioral modeling and protocol synthesis in system design
The design productivity gap has been recognized by the semiconductor industry as one of the major threats to the continued growth of system-on-chips and embedded systems. Ad-hoc sy...
Jean-Pierre Talpin, Paul Le Guernic
SP
2008
IEEE
132views Security Privacy» more  SP 2008»
13 years 5 months ago
Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
Michael Backes, Matteo Maffei, Dominique Unruh
FUIN
2010
130views more  FUIN 2010»
13 years 5 months ago
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
Fabrizio Riguzzi
LICS
2009
IEEE
14 years 1 months ago
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
Michele Basaldella, Claudia Faggian
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
14 years 25 days ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto