doganulus / montre
The original timed regular expression matcher over temporal behaviors
☆15Updated last year
Alternatives and similar repositories for montre:
Users that are interested in montre are comparing it to the libraries listed below
- λ² is a tool for synthesizing functional programs from input-output examples.☆68Updated 2 years ago
- The DejaVu runtime verification system, using BDDs for storing data occurring in observed events.☆18Updated 11 months ago
- The Ciao Preprocessor☆11Updated 3 months ago
- There is a new version of dReal, available at https://github.com/dreal/dreal4☆49Updated 3 years ago
- Quantifier Elimination by Partial Cylindrical Algebraic Decomposition☆24Updated 9 months ago
- A heuristic procedure for proving inequalities☆33Updated 6 years ago
- Offline partial evaluation system for Prolog written using the cogen approach☆19Updated 8 years ago
- Programming language based on the synchronous and constraint paradigms☆15Updated 4 years ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- An implementation of Hoare and He's Unifying Theories of Programming in Isabelle☆34Updated last year
- Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]☆25Updated 3 years ago
- Tool for Rigorous Estimation of Round-Off Floating-Point Errors☆30Updated 6 months ago
- PC-miner tool for program chairs☆24Updated this week
- This repository contains the Maude 2 interpreter source tree.☆43Updated 7 years ago
- Provides a reference implementation of FeatherweightRust in Java.☆14Updated 3 years ago
- TriCera: a model checker for C programs☆24Updated last week
- An equational theorem prover based on Knuth-Bendix completion☆50Updated this week
- αProlog☆17Updated last year
- The Standard Interface for Incremental Satisfiability Solving☆49Updated 2 years ago
- A best-first-search theorem prover implemented in Isabelle☆34Updated 2 years ago
- Robots powered by Constructive Reals☆34Updated 7 years ago
- ☆46Updated 7 months ago
- ☆54Updated this week
- The project SPARK Formal aims at developing a complete semantics of the SPARK language in Coq.☆11Updated 3 years ago
- ☆34Updated 4 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- ☆52Updated last week
- Abstract interpreter for real-world application programs☆32Updated 11 years ago
- MONA - a decision procedure for monadic second-order logic on finite strings and trees☆48Updated 5 years ago