Sciweavers

7971 search results - page 187 / 1595
» On unbounded operators and applications
Sort
View
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 10 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
PPOPP
2010
ACM
15 years 8 months ago
Helper locks for fork-join parallel programming
Helper locks allow programs with large parallel critical sections, called parallel regions, to execute more efficiently by enlisting processors that might otherwise be waiting on ...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 6 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
JAR
2006
236views more  JAR 2006»
15 years 6 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
CDC
2010
IEEE
125views Control Systems» more  CDC 2010»
14 years 10 months ago
Persistent patrol with limited-range on-board sensors
— We propose and analyze the Persistent Patrol Problem (PPP). An unmanned aerial vehicle (UAV) moving with constant speed and unbounded acceleration patrols a bounded region of t...
Vu Anh Huynh, John Enright, Emilio Frazzoli