Sciweavers

1497 search results - page 208 / 300
» Extended static checking
Sort
View
89
Voted
JAIR
2011
103views more  JAIR 2011»
14 years 7 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss
SIGSOFT
2005
ACM
16 years 1 months ago
Reasoning about confidentiality at requirements engineering time
Growing attention is being paid to application security at requirements engineering time. Confidentiality is a particular subclass of security concerns that requires sensitive inf...
Renaud De Landtsheer, Axel van Lamsweerde
193
Voted
ICDT
2009
ACM
125views Database» more  ICDT 2009»
16 years 1 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
209
Voted
POPL
2005
ACM
16 years 1 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
ICWE
2005
Springer
15 years 6 months ago
Modelling the Behaviour of Web Applications with ArgoUWE
A methodology needs to be empowered by appropriate tool support. The CASE tool ArgoUWE supports designers in the use of the UWE methodology for the systematic, UML-based developmen...
Alexander Knapp, Nora Koch, Gefei Zhang