The following pages link to Hélène Kirchner (Q271708):
Displayed 50 items.
- Runtime verification for biochemical programs (Q271709) (← links)
- Proving weak properties of rewriting (Q554217) (← links)
- Equational completion in order-sorted algebras (Q912606) (← links)
- Inductive proof search modulo (Q1037404) (← links)
- Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
- REVEUR-3: The implementation of a general completion procedure parameterized by built-in theories and strategies (Q1097686) (← links)
- Schematization of infinite sets of rewrite rules generated by divergent completion processes (Q1262755) (← links)
- Dynamically typed computations for order-sorted equational presentations (Q1264443) (← links)
- Combining symbolic constraint solvers on algebraic domains (Q1338341) (← links)
- Combining assisted and automated deduction (Q1601835) (← links)
- ELAN from a rewriting logic point of view (Q1608914) (← links)
- CASL: the Common Algebraic Specification Language. (Q1853453) (← links)
- External rewriting for skeptical proof assistants (Q1868511) (← links)
- Labelled port graph -- a formal structure for models and computations (Q2333309) (← links)
- Labelled graph strategic rewriting for social networks (Q2413024) (← links)
- Secure interoperation design in multi-domains environments based on colored Petri nets (Q2510546) (← links)
- (Q2703693) (← links)
- (Q2740996) (← links)
- Algebraic Specifications, Higher-order Types and Set-theoretic Models (Q2752531) (← links)
- Labelled Graph Rewriting Meets Social Networks (Q2827834) (← links)
- Induction for termination with local strategies (Q2841240) (← links)
- (Q2851054) (← links)
- (Q2863876) (← links)
- Formal Specification and Validation of Security Policies (Q2889828) (← links)
- Rewriting Strategies and Strategic Rewrite Programs (Q2945718) (← links)
- Termination of rewriting under strategies (Q2946568) (← links)
- (Q3086785) (← links)
- Component-Based Security Policy Design with Colored Petri Nets (Q3184744) (← links)
- (Q3338226) (← links)
- (Q3388749) (← links)
- (Q3490927) (← links)
- Constraint Based Strategies (Q3557093) (← links)
- Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations (Q3608811) (← links)
- A Higher-Order Graph Calculus for Autonomic Computing (Q3655135) (← links)
- (Q3664457) (← links)
- (Q3696486) (← links)
- (Q3792234) (← links)
- (Q3795207) (← links)
- (Q3805889) (← links)
- Completion of a Set of Rules Modulo a Set of Equations (Q3816048) (← links)
- (Q3817573) (← links)
- Programming with equalities, subsorts, overloading, and parametrization in OBJ (Q3992232) (← links)
- The term rewriting approach to automated theorem proving (Q4015952) (← links)
- (Q4222851) (← links)
- (Q4222857) (← links)
- (Q4222858) (← links)
- (Q4223001) (← links)
- (Q4400884) (← links)
- (Q4447221) (← links)
- (Q4619820) (← links)