Sciweavers

245 search results - page 24 / 49
» Verifying networked programs using a model checker extension
Sort
View
IJCAI
2007
14 years 11 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
TACAS
2007
Springer
158views Algorithms» more  TACAS 2007»
15 years 3 months ago
Automatic Analysis of the Security of XOR-Based Key Management Schemes
We describe a new algorithm for analysing security protocols that use XOR, such as key-management APIs. As a case study, we consider the IBM 4758 CCA API, which is widely used in t...
Véronique Cortier, Gavin Keighren, Graham S...
90
Voted
WWW
2002
ACM
15 years 10 months ago
Model checking cobweb protocols for verification of HTML frames behavior
HTML documents composed of frames can be difficult to write correctly. We demonstrate a technique that can be used by authors manually creating HTML documents (or by document edit...
P. David Stotts, Jaime Navon
ICFEM
2009
Springer
14 years 7 months ago
An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the descri...
Joakim Byg, Kenneth Yrke Jørgensen, Jir&iac...
95
Voted
HYBRID
2010
Springer
15 years 4 months ago
From synchronous programs to symbolic representations of hybrid systems
In this paper, we present an extension of the synchronous language Quartz by new kinds of variables, actions and statements for modeling the interaction of synchronous systems wit...
Kerstin Bauer, Klaus Schneider