Sciweavers

219 search results - page 30 / 44
» Towards Hilbertian Formal Methods
Sort
View
CAV
2005
Springer
127views Hardware» more  CAV 2005»
14 years 3 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
ICPW
2007
13 years 11 months ago
Rule responder: RuleML-based agents for distributed collaboration on the pragmatic web
The Rule Responder project (responder.ruleml.org) extends the Semantic Web towards a Pragmatic Web infrastructure for collaborative human-computer networks. These allow semi-autom...
Adrian Paschke, Harold Boley, Alexander Kozlenkov,...
IPL
2008
102views more  IPL 2008»
13 years 9 months ago
The connection between two ways of reasoning about partial functions
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
John S. Fitzgerald, Cliff B. Jones
ASE
2008
102views more  ASE 2008»
13 years 10 months ago
Model driven code checking
Model checkers were originally developed to support the formal verification of high-level design models of distributed system designs. Over the years, they have become unmatched in...
Gerard J. Holzmann, Rajeev Joshi, Alex Groce
ICRA
2007
IEEE
124views Robotics» more  ICRA 2007»
14 years 4 months ago
Using Constrained Intuitionistic Linear Logic for Hybrid Robotic Planning Problems
— Synthesis of robot behaviors towards nontrivial goals often requires reasoning about both discrete and continuous aspects of the underlying domain. Existing approaches in build...
Uluc Saranli, Frank Pfenning