Sciweavers

261 search results - page 31 / 53
» Formal Proof from UML Models
Sort
View
89
Voted
ANOR
2002
67views more  ANOR 2002»
15 years 3 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Daniel Riera, Neil Yorke-Smith
HYBRID
2007
Springer
15 years 7 months ago
Safety Verification of an Aircraft Landing Protocol: A Refinement Approach
Abstract. In this paper, we propose a new approach for formal verification of hybrid systems. To do so, we present a new refinement proof technique, a weak refinement using step in...
Shinya Umeno, Nancy A. Lynch
122
Voted
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
15 years 7 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
135
Voted
ANSS
1991
IEEE
15 years 7 months ago
A provably correct, non-deadlocking parallel event simulation algorithm
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
Meng-Lin Yu, Sumit Ghosh, Erik DeBenedictis
162
Voted
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
15 years 9 months ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...