Sciweavers

24 search results - page 4 / 5
» Reasoning about Idealized ALGOL Using Regular Languages
Sort
View
96
Voted
CSFW
2006
IEEE
15 years 7 months ago
Decentralized Robustness
Robustness links confidentiality and integrity properties of a computing system and has been identified as a useful property for characterizing and enforcing security. Previous ...
Stephen Chong, Andrew C. Myers
103
Voted
AMAST
1998
Springer
15 years 5 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak
108
Voted
GI
2009
Springer
14 years 11 months ago
A BPMN Case Study: Paper Review and Submission System
: We explore the expressiveness of the BPMN workflow modelling language by applying it to MuCoMS, a paper submission system. This well known application domain is a suitable exampl...
Markus Kirchberg, Ove Sörensen, Bernhard Thal...
KBSE
2010
IEEE
14 years 11 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
103
Voted
LICS
2006
IEEE
15 years 7 months ago
Provable Implementations of Security Protocols
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
Andrew D. Gordon