Sciweavers

1912 search results - page 204 / 383
» GOAL as a Planning Formalism
Sort
View
SAS
1999
Springer
124views Formal Methods» more  SAS 1999»
15 years 10 months ago
State Space Reduction Based on Live Variables Analysis
The intrinsic complexity of most protocol speci cations in particular, and of asynchronous systems in general, lead us to study combinations of static analysis with classical model...
Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu
LACL
1998
Springer
15 years 10 months ago
Sequential Construction of Logical Forms
In this paper we give a formal description of the parsing model that underlies the treatment of Long Distance Dependencies, Topic and Focus, Ellipsis and Quantification in, amongs...
Wilfried Meyer-Viol
FM
1997
Springer
174views Formal Methods» more  FM 1997»
15 years 10 months ago
A Proof Obligation Generator for VDM-SL
In this paper an extension of the IFAD VDM-SL Toolbox with a proof obligation generator is described. Static type checking in VDM is undecidable in general and therefore the type c...
Bernhard K. Aichernig, Peter Gorm Larsen
GI
2009
Springer
15 years 10 months ago
Classifying Privacy and Verifiability Requirements for Electronic Voting
Abstract: Voter privacy and verifiability are fundamental security concepts for electronic voting. Existing literature on electronic voting provides many definitions and interpreta...
Lucie Langer, Axel Schmidt, Melanie Volkamer, Joha...
EUROMICRO
2007
IEEE
15 years 8 months ago
Analysis of BPEL Data Dependencies
BPEL is a de-facto standard language for web service orchestration. It is a challenge to test BPEL processes automatically because of the complex features of the language. The cur...
Yongyan Zheng, Jiong Zhou, Paul Krause