Sciweavers

456 search results - page 48 / 92
» A Proof System for Abstract Non-interference
Sort
View
GC
2004
Springer
14 years 2 months ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...
KI
1990
Springer
14 years 21 days ago
The Representation of Program Synthesis in Higher Order Logic
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
Christoph Kreitz
JAR
2006
103views more  JAR 2006»
13 years 8 months ago
A Framework for Verifying Bit-Level Pipelined Machines Based on Automated Deduction and Decision Procedures
We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...
Panagiotis Manolios, Sudarshan K. Srinivasan
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
13 years 12 months ago
Dealing with stochastic reachability
Abstract— For stochastic hybrid systems, stochastic reachability is very little supported mainly because of complexity and difficulty of the associated mathematical problems. In...
Manuela L. Bujorianu
JAR
2002
82views more  JAR 2002»
13 years 8 months ago
A Compendium of Continuous Lattices in MIZAR
Abstract. This paper reports on the Mizar formalization of the theory of continuous lattices as presented in A Compendium of Continuous Lattices, [25]. By the Mizar formalization w...
Grzegorz Bancerek, Piotr Rudnicki