Sciweavers

551 search results - page 108 / 111
» {log}: A Logic Programming Language with Finite Sets
Sort
View
ICALP
2004
Springer
14 years 1 months ago
Linear and Branching Metrics for Quantitative Transition Systems
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
Luca de Alfaro, Marco Faella, Mariëlle Stoeli...
TAP
2009
Springer
178views Hardware» more  TAP 2009»
14 years 2 months ago
Dynamic Symbolic Execution for Testing Distributed Objects
Abstract. This paper extends dynamic symbolic execution to distributed and concurrent systems. Dynamic symbolic execution can be used in software testing to systematically identify...
Andreas Griesmayer, Bernhard K. Aichernig, Einar B...
IFIP
2004
Springer
14 years 1 months ago
The Driving Philosophers
We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a rou...
Sébastien Baehni, Roberto Baldoni, Rachid G...
ICLP
1999
Springer
14 years 15 days ago
Concurrency in Prolog Using Threads and a Shared Database
Concurrency in Logic Programming has received much attention in the past. One problem with many proposals, when applied to Prolog, is that they involve large modifications to the...
Manuel Carro, Manuel V. Hermenegildo
ASIAN
2006
Springer
118views Algorithms» more  ASIAN 2006»
13 years 12 months ago
An Approach to Formal Verification of Arithmetic Functions in Assembly
Abstract. It is customary to write performance-critical parts of arithmetic functions in assembly: this enables finely-tuned algorithms that use specialized processor instructions....
Reynald Affeldt, Nicolas Marti