1912 search results - page 279 / 383 » On the evaluation of argumentation formalisms |
179
click to vote
SAS
2010
Springer
15 years 4 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
141
click to vote
SCN
2010
Springer
15 years 4 months ago
2010
Springer
In this work, we consider Authentication and Key Agreement (AKA), a popular client-server Key Exchange (KE) protocol, commonly used in wireless standards (e.g., UMTS), and widely c...
211
click to vote
PLDI
2011
ACM
14 years 9 months ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
167
click to vote
POPL
2012
ACM
14 years 1 months ago
2012
ACM
Software-defined networks (SDNs) are a new implementation architecture in which a controller machine manages a distributed collection of switches, by instructing them to install ...
214
click to vote
TKDE
2012
13 years 8 months ago
2012
— We present a query formulation language (called MashQL) in order to easily query and fuse structured data on the web. The main novelty of MashQL is that it allows people with l...