329 search results - page 27 / 66 » Automatic Proofs for Scalecharts |
AISC
1998
Springer
15 years 3 months ago
1998
Springer
While propositional modal logic is a standard tool, first-order modal logic is not. Indeed, it is not generally understood that conventional first-order syntax is insufficiently ex...
ENDM
2010
14 years 11 months ago
2010
The performance of Branch-and-Bound algorithms is severely impaired by the presence of symmetric optima in a given problem. We describe a method for the automatic detection of for...
89
Voted
ENTCS
2008
14 years 11 months ago
2008
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
111
click to vote
ICWE
2010
Springer
14 years 9 months ago
2010
Springer
This position paper describes an approach to predict the performances of a Web application already in the early stages of application development. It leverages the wealth of inform...
CSFW
2005
IEEE
15 years 4 months ago
2005
IEEE
We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded ...