140 search results - page 19 / 28 » Verifying timing properties of concurrent algorithms |
130
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switc...
212
Voted
POPL
2007
ACM
16 years 2 months ago
2007
ACM
Pushdown Systems (PDSs) has become an important paradigm for program analysis. Indeed, recent work has shown a deep connection between inter-procedural dataflow analysis for seque...
124
click to vote
CADE
2005
Springer
16 years 2 months ago
2005
Springer
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...
153
click to vote
HASKELL
2009
ACM
15 years 8 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
128
Voted
COCOON
2003
Springer
15 years 7 months ago
2003
Springer
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...