Sciweavers

203 search results - page 7 / 41
» Modal Expressiveness of Graph Properties
Sort
View
LICS
2007
IEEE
14 years 1 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
LOGCOM
2007
91views more  LOGCOM 2007»
13 years 7 months ago
A New Modal Approach to the Logic of Intervals
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
Altaf Hussain
APSEC
2008
IEEE
13 years 9 months ago
Emergent Properties in Reactive Systems
Reactive systems are often described by interconnecting sub-components along architectural connectors defining communication policies. Generally, such global systems may exhibit p...
Marc Aiguier, Pascale Le Gall, Mbarka Mabrouki
CPP
2011
99views more  CPP 2011»
12 years 7 months ago
Proof-Carrying Code in a Session-Typed Process Calculus
Abstract. Dependent session types allow us to describe not only properties of the I/O behavior of processes but also of the exchanged data. In this paper we show how to exploit dep...
Frank Pfenning, Luís Caires, Bernardo Tonin...
CONCUR
2004
Springer
14 years 24 days ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König