The following pages link to Michael Leuschel (Q418180):
Displayed 44 items.
- Static slicing of explicitly synchronized languages (Q418185) (← links)
- Experiments in program verification using Event-B (Q432154) (← links)
- Efficient approximate verification of B and Z models via symmetry markers (Q622591) (← links)
- Optimising the ProB model checker for B using partial order reduction (Q736463) (← links)
- Formal model-based constraint solving and document generation (Q1784778) (← links)
- Validation of formal models by refinement animation (Q1951638) (← links)
- Spot the difference: a detailed comparison between B and Event-B (Q2117587) (← links)
- Integrating formal specifications into applications: the ProB Java API (Q2147695) (← links)
- Operation caching and state compression for model checking of high-level models. How to have your cake and eat it (Q2165507) (← links)
- Efficient and flexible access control via Jones-optimal logic program specialisation (Q2271897) (← links)
- Fast offline partial evaluation of logic programs (Q2437798) (← links)
- (Q2723916) (← links)
- (Q2729911) (← links)
- (Q2763965) (← links)
- (Q2767038) (← links)
- (Q2767047) (← links)
- (Q2767102) (← links)
- Directed Model Checking for B: An Evaluation and New Techniques (Q2999306) (← links)
- Efficient Approximate Verification of Promela Models Via Symmetry Markers (Q3510803) (← links)
- The High Road to Formal Validation: (Q3535366) (← links)
- Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation (Q3557098) (← links)
- Towards Just-In-Time Partial Evaluation of Prolog (Q3558295) (← links)
- Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques (Q3591078) (← links)
- The MEB and CEB Static Analysis for CSP Specifications (Q3617433) (← links)
- Fast Offline Partial Evaluation of Large Logic Programs (Q3617434) (← links)
- Creating specialised integrity checks through partial evaluation of meta-interpreters (Q4223470) (← links)
- (Q4414739) (← links)
- Logic program specialisation through partial deduction: Control issues (Q4452606) (← links)
- (Q4499252) (← links)
- (Q4808810) (← links)
- Offline specialisation in Prolog using a hand-written compiler generator (Q4819007) (← links)
- Conjunctive partial deduction: foundations, control, algorithms, and experiments (Q4939538) (← links)
- (Q4944878) (← links)
- (Q5020651) (← links)
- Making ProB Compatible with SWI-Prolog (Q5038477) (← links)
- Functional and Logic Programming (Q5308015) (← links)
- Programming Languages and Systems (Q5316584) (← links)
- Fully Automatic Binding-Time Analysis for Prolog (Q5458793) (← links)
- ZB 2005: Formal Specification and Development in Z and B (Q5703812) (← links)
- Program Development in Computational Logic (Q5712538) (← links)
- Program Development in Computational Logic (Q5712548) (← links)
- Logic Based Program Synthesis and Transformation (Q5713934) (← links)
- From Software Specifications to Constraint Programming (Q6039382) (← links)
- Trace preservation in B and Event-B refinements (Q6151629) (← links)