Sciweavers

255 search results - page 31 / 51
» Proving BDI Properties of Agent-Oriented Programming Languag...
Sort
View
POPL
2004
ACM
16 years 6 months ago
Abstractions from proofs
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
HASE
1998
IEEE
15 years 10 months ago
Verification in Concurrent Programming with Petri Nets Structural Techniques
This paper deals with verification of flow control in concurrent programs. We use Ada language model as reference. After translation of Ada programs into Petri nets (named Ada net...
Kamel Barkaoui, Jean-François Pradat-Peyre
IFIP
2004
Springer
15 years 11 months ago
Formal Analysis of a Fair Payment Protocol
We formally specify a payment protocol described in [Vogt et al., 2001]. This protocol is intended for fair exchange of time-sensitive data. Here the µCRL language is used to form...
Jan Cederquist, Muhammad Torabi Dashti
CCS
2005
ACM
15 years 11 months ago
Formal security analysis of basic network-attached storage
We study formal security properties of network-attached storage (NAS) in an applied pi calculus. We model NAS as an implementation of a specification based on traditional central...
Avik Chaudhuri, Martín Abadi
LICS
2010
IEEE
15 years 4 months ago
A Generic Operational Metatheory for Algebraic Effects
—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...
Patricia Johann, Alex Simpson, Janis Voigtlän...