Add to ORKGAs computer system complexity increases, new methods and logics are needed to scale up to the complexity of practical systems without sacrificing logical precision and ease of specification. To that end, the goal of this research project is to develop rewriting-based symbolic analysis methods that (1) can analyze systems which need an unbounded amount of time and/or space (2) may be highly distributed (3) use modular specification techniques so that work is never wasted (4) are generic across a possibly infinite number of domain theories. Towards this goal, we present our research on theory-generic satisfiability and rewrite-theory-generic specification and analysis methods, discuss prototype implementations, and consider future directions
The growing popularity of infrastructure-as-a-service cloud computing, software-defined networking, ...
Industry is increasingly dependent on distributed systems. In order to prevent the users having to d...
In recent years, the use of symbolic analysis in systems for testing and verifying programs has exp...
As computer system complexity increases, new methods and logics are needed to scale up to the comple...
International audienceSequential emulation is a semantics-based technique to automatically reduce pr...
AbstractIn this paper we propose to employ Rewriting Logic as a generic and uniform approach to supp...
Unification and narrowing are a key ingredient not only to solve equations modulo an equational theo...
Model checking is an automatic technique for verifying concurrent systems. The properties of the sys...
Automated formal analysis methods such as program verication and synthesis algorithms often suffer f...
Automated formal analysis methods such as program verication and synthesis algorithms often suffer f...
Reachability logic has been applied to K rewrite-rule-based language definitions as a language...
Abstract. Rewriting is a general and expressive way of specifying con-current systems, where concurr...
AbstractThe paper shows that, by an appropriate choice of a rich assertional language, it is possibl...
textThe goal of formal verification is to use mathematical methods to prove that a computing system...
Abstract The paper shows that, by an appropriate choice of a rich assertional language, it is possib...
The growing popularity of infrastructure-as-a-service cloud computing, software-defined networking, ...
Industry is increasingly dependent on distributed systems. In order to prevent the users having to d...
In recent years, the use of symbolic analysis in systems for testing and verifying programs has exp...
As computer system complexity increases, new methods and logics are needed to scale up to the comple...
International audienceSequential emulation is a semantics-based technique to automatically reduce pr...
AbstractIn this paper we propose to employ Rewriting Logic as a generic and uniform approach to supp...
Unification and narrowing are a key ingredient not only to solve equations modulo an equational theo...
Model checking is an automatic technique for verifying concurrent systems. The properties of the sys...
Automated formal analysis methods such as program verication and synthesis algorithms often suffer f...
Automated formal analysis methods such as program verication and synthesis algorithms often suffer f...
Reachability logic has been applied to K rewrite-rule-based language definitions as a language...
Abstract. Rewriting is a general and expressive way of specifying con-current systems, where concurr...
AbstractThe paper shows that, by an appropriate choice of a rich assertional language, it is possibl...
textThe goal of formal verification is to use mathematical methods to prove that a computing system...
Abstract The paper shows that, by an appropriate choice of a rich assertional language, it is possib...
The growing popularity of infrastructure-as-a-service cloud computing, software-defined networking, ...
Industry is increasingly dependent on distributed systems. In order to prevent the users having to d...
In recent years, the use of symbolic analysis in systems for testing and verifying programs has exp...