713 search results - page 121 / 143 » Model Checking and Transitive-Closure Logic |
111
click to vote
CAV
2007
Springer
15 years 10 months ago
2007
Springer
lued Abstraction for Continuous-Time Markov Chains⋆ Joost-Pieter Katoen1 , Daniel Klink1 , Martin Leucker2 , and Verena Wolf3 RWTH Aachen University1 , TU Munich2 , University of...
137
Voted
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper presents a prototype implementation of an intelligent assistance architecture for data-driven simulation specialising in qualitative data in the social science...
134
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
116
Voted
LICS
2000
IEEE
15 years 8 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
146
Voted
JFP
2008
15 years 4 months ago
2008
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The...