Sciweavers

160 search results - page 6 / 32
» Modeling, specification, and verification of automaton progr...
Sort
View
ENTCS
2008
170views more  ENTCS 2008»
13 years 8 months ago
A Coq Library for Verification of Concurrent Programs
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Reynald Affeldt, Naoki Kobayashi
FAC
2008
100views more  FAC 2008»
13 years 8 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
FM
2003
Springer
174views Formal Methods» more  FM 2003»
14 years 1 months ago
Model-Checking TRIO Specifications in SPIN
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
Angelo Morzenti, Matteo Pradella, Pierluigi San Pi...
EMSOFT
2008
Springer
13 years 10 months ago
Automatically transforming and relating Uppaal models of embedded systems
Relations between models are important for effective automatic validation, for comparing implementations with specifications, and for increased understanding of embedded systems d...
Timothy Bourke, Arcot Sowmya
ATAL
2008
Springer
13 years 10 months ago
Towards verifying compliance in agent-based web service compositions
We explore the problem of specification and verification of compliance in agent based Web service compositions. We use the formalism of temporal-epistemic logic suitably extended ...
Alessio Lomuscio, Hongyang Qu, Monika Solanki