Sciweavers

3658 search results - page 533 / 732
» The logic of proofs, semantically
Sort
View
ATAL
2009
Springer
15 years 11 months ago
GDT4MAS: an extension of the GDT model to specify and to verify MultiAgent systems
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
Bruno Mermet, Gaële Simon
ICFP
2000
ACM
15 years 11 months ago
The duality of computation
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
Pierre-Louis Curien, Hugo Herbelin
AMAST
2006
Springer
15 years 10 months ago
State Space Representation for Verification of Open Systems
Abstract. When designing an open system, there might be no implementation available for certain components at verification time. For such systems, verification has to be based on a...
Irem Aktug, Dilian Gurov
FOAL
2008
ACM
15 years 8 months ago
Certificate translation for specification-preserving advices
Aspect Oriented Programming (AOP) has significant potential to separate functionality and cross-cutting concerns. In particular, AOP supports an incremental development process, i...
Gilles Barthe, César Kunz
CAV
2012
Springer
222views Hardware» more  CAV 2012»
13 years 9 months ago
Leveraging Interpolant Strength in Model Checking
Craig interpolation is a well known method of abstraction successfully used in both hardware and software model checking. The logical strength of interpolants can affect the quali...
Simone Fulvio Rollini, Ondrej Sery, Natasha Sharyg...