Sciweavers

3546 search results - page 532 / 710
» A Causal Logic of Logic Programming
Sort
View
APAL
2008
104views more  APAL 2008»
13 years 10 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
ENTCS
2006
123views more  ENTCS 2006»
13 years 10 months ago
From Discrete Duration Calculus to Symbolic Automata
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
Laure Gonnord, Nicolas Halbwachs, Pascal Raymond
ENTCS
2006
120views more  ENTCS 2006»
13 years 10 months ago
Temporal Assertions using AspectJ
We present a runtime verification framework for Java programs. Properties can be specified in Linear-time Temporal Logic (LTL) over AspectJ pointcuts. These properties are checked...
Volker Stolz, Eric Bodden
COR
2007
176views more  COR 2007»
13 years 10 months ago
Scheduling and routing of automated guided vehicles: A hybrid approach
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
Ayoub Insa Corréa, André Langevin, L...
ENTCS
2007
107views more  ENTCS 2007»
13 years 10 months ago
Formal Translation of Bytecode into BoogiePL
Many modern program verifiers translate the program to be verified and its specification into a simple intermediate representation and then compute verification conditions on ...
Hermann Lehner, Peter Müller