Sciweavers

115 search results - page 20 / 23
» Verifying Probabilistic Procedural Programs
Sort
View
106
Voted
SIGSOFT
2007
ACM
15 years 11 months ago
Quantitative verification: models techniques and tools
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
Marta Z. Kwiatkowska
CORR
2004
Springer
120views Education» more  CORR 2004»
14 years 10 months ago
Validating a Web Service Security Abstraction by Typing
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...
Andrew D. Gordon, Riccardo Pucella
CORR
2004
Springer
177views Education» more  CORR 2004»
14 years 10 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
94
Voted
CHI
2008
ACM
15 years 7 days ago
Introducing item response theory for measuring usability inspection processes
Usability evaluation methods have a long history of research. Latest contributions significantly raised the validity of method evaluation studies. But there is still a measurement...
Martin Schmettow, Wolfgang Vietze
106
Voted
DOCENG
2006
ACM
15 years 4 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda