POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
The language of machines: an introduction to computability and formal languages
The language of machines: an introduction to computability and formal languages
A closed-form evaluation for Datalog queries with integer (gap)-order constraints
ICDT Selected papers of the 4th international conference on Database theory
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Model checking
The MLPQ/GIS constraint database system
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Introduction to constraint databases
Introduction to constraint databases
Symbolic Model Checking
DATALOG with Constraints: A Foundation for Trust Management Languages
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Reformulation and Approximation in Model Checking
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Reachable state space analysis of LOTOS specifications
Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Abstraction-Based Model Checking Using Modal Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Symbolic Verification with Gap-Order Constraints
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Constraint Databases: A Survey
Selected Papers from a Workshop on Semantics in Databases
Delay Analysis in Synchronous Programs
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Symbolic Verification with Periodic Sets
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Design of a Role-Based Trust-Management Framework
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Decentralized Trust Management
Decentralized Trust Management
Computation: finite and infinite machines
Computation: finite and infinite machines
Constraint Databases
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
A survey of trust in internet applications
IEEE Communications Surveys & Tutorials
The constraint database approach to software verification
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
CDB-PV: a constraint database-based program verifier
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Abstraction and complexity measures
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Hi-index | 0.00 |
Verification of the incorrectness of programs and automata needs to be taken as seriously as the verification of correctness. However, there are no good general methods that always terminate and prove incorrectness. We propose one general method based on a lower bound approximation of the semantics of programs and automata. Based on the lower-bound approximation, it becomes easy to check whether certain error states are reached. This is in contrast to various abstract interpretation techniques that make an upper bound approximation of the semantics and test that the error states are not reached. The precision of our lower bound approximation is controlled by a single parameter that can be adjusted by the user of the MLPQ system in which the approximation method is implemented. As the value of the parameter decreases the implementation results in a finer program semantics approximation but requires a longer evaluation time. However, for all input parameter values the program is guaranteed to terminate. We use the lower bound approximation to verify the incorrectness of a subway train control automaton. We also use the lower bound approximation for a problem regarding computer security via trust management programs. We propose a trust management policy language extending earlier work by Li and Mitchell. Although, our trust management programming language is Turing-complete, programs in this language have semantics that lend themselves naturally to a lower-bound approximation. Namely, the lower bound approximation is such that no unwarranted authorization is given at any time, although some legitimate access may be denied.