Sciweavers

137 search results - page 23 / 28
» Reasoning About Transfinite Sequences
Sort
View
IANDC
2008
120views more  IANDC 2008»
13 years 7 months ago
A framework for compositional verification of security protocols
Automatic security protocol analysis is currently feasible only for small protocols. Since larger protocols quite often are composed of many small protocols, compositional analysi...
Suzana Andova, Cas J. F. Cremers, Kristian Gj&osla...
LISP
2008
105views more  LISP 2008»
13 years 7 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
JUCS
2006
131views more  JUCS 2006»
13 years 7 months ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita
SAS
2010
Springer
159views Formal Methods» more  SAS 2010»
13 years 6 months ago
Automatic Abstraction for Intervals Using Boolean Formulae
c Abstraction for Intervals Using Boolean Formulae J¨org Brauer1 and Andy King2 1 Embedded Software Laboratory, RWTH Aachen University, Germany 2 Portcullis Computer Security, Pin...
Jörg Brauer, Andy King
ICRA
2010
IEEE
136views Robotics» more  ICRA 2010»
13 years 5 months ago
Efficient planning under uncertainty for a target-tracking micro-aerial vehicle
A helicopter agent has to plan trajectories to track multiple ground targets from the air. The agent has partial information of each target's pose, and must reason about its u...
Ruijie He, Abraham Bachrach, Nicholas Roy