Sciweavers

4722 search results - page 637 / 945
» Representation-independent program analysis
Sort
View
JAR
1998
60views more  JAR 1998»
15 years 6 months ago
Elimination of Self-Resolving Clauses
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
Hans Jürgen Ohlbach
JLP
1998
147views more  JLP 1998»
15 years 6 months ago
Automated Reasoning with a Constraint-Based Metainterpreter
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
Henning Christiansen
SP
2002
IEEE
161views Security Privacy» more  SP 2002»
15 years 6 months ago
Improving Computer Security Using Extended Static Checking
We describe a method for finding security flaws in source code by way of static analysis. The method is notable because it allows a user to specify a wide range of security proper...
Brian Chess
SODA
2010
ACM
143views Algorithms» more  SODA 2010»
15 years 5 months ago
Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh...
CDC
2010
IEEE
124views Control Systems» more  CDC 2010»
15 years 1 months ago
A relaxation of Lyapunov conditions and controller synthesis for discrete-time periodic systems
This paper proposes a novel approach to stability analysis and controller synthesis for discrete-time periodically time-varying systems. Firstly, a relaxation of standard Lyapunov ...
Christoph Bohm, Mircea Lazar, Frank Allgöwer