Sciweavers

223 search results - page 31 / 45
» Logic programs with monotone abstract constraint atoms
Sort
View
CP
2006
Springer
15 years 1 months ago
Generating Propagators for Finite Set Constraints
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
Guido Tack, Christian Schulte, Gert Smolka
ASIAN
2009
Springer
308views Algorithms» more  ASIAN 2009»
14 years 10 months ago
Automated Security Proof for Symmetric Encryption Modes
Abstract. We presents a compositional Hoare logic for proving semantic security of modes of operation for symmetric key block ciphers. We propose a simple programming language to s...
Martin Gagné, Pascal Lafourcade, Yassine La...
TOOLS
2008
IEEE
15 years 3 months ago
Modeling of Component Environment in Presence of Callbacks and Autonomous Activities
Abstract. A popular approach to compositional verification of component-based applications is based on the assume-guarantee paradigm, where an assumption models behavior of an env...
Pavel Parizek, Frantisek Plasil
CLIMA
2007
14 years 11 months ago
Language Constructs for Multi-agent Programming
Abstract. In this paper we are concerned with proposing, analyzing and implementing simple, yet flexible, constructs for multi-agent programming. In particular, we wish to extend ...
Louise A. Dennis, Michael Fisher, Anthony Hepple
OOPSLA
2010
Springer
14 years 7 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...