81 search results - page 15 / 17 » A Formalisation of Finite Automata Using Hereditarily Finite... |
116
click to vote
APLAS
2003
ACM
15 years 5 months ago
2003
ACM
We investigate how to automatically verify that resources such as files are not used improperly or unsafely by a program. We employ a mixture of compile-time analysis and run-time ...
FAC
2008
15 years 1 months ago
2008
We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition stru...
103
click to vote
IANDC
2006
15 years 1 months ago
2006
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
144
click to vote
DLT
2010
15 years 2 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
119
click to vote
WWW
2004
ACM
16 years 2 months ago
2004
ACM
This paper presents a set of tools and techniques for analyzing interactions of composite web services which are specified in BPEL and communicate through asynchronous XML message...