Travelled to:1 × Austria
1 × Belgium
1 × Canada
1 × Cyprus
1 × Japan
1 × Norway
1 × Switzerland
2 × Sweden
3 × France
3 × Portugal
3 × Spain
3 × The Netherlands
5 × Germany
7 × United Kingdom
8 × USA
9 × Italy
Collaborated with:∅ D.D.Schreye S.Craig H.Lehmann B.Martens D.Plagge M.J.Butler M.Samia G.Vidal J.Bendisposto M.Bruynooghe D.Elphick K.F.Sagonas S.Krings C.F.Bolz T.Massart D.Schneider W.Vanhoof M.Varea I.Dobrikov D.Hansen S.Hallerstede A.Rigo B.Farwer S.Gruner M.H.Sørensen M.Llorens J.Oliver J.Silva S.Tamarit T.Witt K.Klose K.Ostermann Q.Wang G.Gupta S.Barker S.J.Cox A.Currie D.A.d.Waal J.Jørgensen A.Savary M.Frappier J.Lanet J.Falampin F.Fritz M.Satpathy S.Ramesh J.P.Gallagher K.S.Henriksen M.Fontaine S.Decorte A.Cuni M.FijaBkowski S.Pedroni S.Wieczorek V.Kozyura A.Roth I.Schieferdecker
Talks about:partial (21) model (14) program (13) specialis (10) deduct (10) evalu (10) specif (9) logic (9) check (8) use (8)
Person: Michael Leuschel
DBLP: Leuschel:Michael
Facilitated 6 volumes:
Ed
EdEd
Ed
Ed
EdContributed to:
2015
20152014201320122012
20112011201120102009
200920092009
2009
2009200820082007
2007
200720062006
2005200520052005
200420042004200420042003
20032003200120012001
200020001999199819981998
199819971996199619961995199519951994Wrote 61 papers:
- FM-2015-SchneiderLW #modelling #problem #validation
- Model-Based Problem Solving for University Timetable Validation and Improvement (DS, ML, TW), pp. 487–495.
- SEFM-2015-KringsBL #proving
- From Failure to Proof: The ProB Disprover for B and Event-B (SK, JB, ML), pp. 199–214.
- SEFM-2015-SavaryFLL #modelling #robust #testing #using
- Model-Based Robustness Testing in Event-B Using Mutation (AS, MF, ML, JLL), pp. 132–147.
- SEFM-2014-DobrikovL #model checking #optimisation #partial order #reduction #using
- Optimising the ProB Model Checker for B Using Partial Order Reduction (ID, ML), pp. 220–234.
- SEFM-2013-KringsL #modelling #physics
- Inferring Physical Units in B Models (SK, ML), pp. 137–151.
- FM-2012-PlaggeL #using #validation
- Validating B, Z and TLA + Using ProB and Kodkod (DP, ML), pp. 372–386.
- IFM-2012-HansenL #validation
- Translating TLA + to B for Validation with ProB (DH, ML), pp. 24–38.
- FASE-2011-BendispostoL #analysis #automation
- Automatic Flow Analysis for Event-B (JB, ML), pp. 50–64.
- ICLP-J-2011-HallerstedeL #concurrent #constraints #specification
- Constraint-based deadlock checking of high-level specifications (SH, ML), pp. 767–782.
- PEPM-2011-BolzCFLPR #jit #partial evaluation
- Allocation removal by partial evaluation in a tracing JIT (CFB, AC, MF, ML, SP, AR), pp. 43–52.
- PPDP-2010-BolzLS #execution #prolog #towards #virtual machine
- Towards a jitting VM for prolog execution (CFB, ML, DS), pp. 99–108.
- FM-2009-LeuschelFFP #automation #modelling #scalability #verification
- Automated Property Verification for Large Scale B Models (ML, JF, FF, DP), pp. 708–723.
- ICPC-2009-SamiaL #architecture #graph #scalability #towards #visualisation
- Towards pie tree visualization of graphs and large software architectures (MS, ML), pp. 301–302.
- LOPSTR-2009-BolzLR #partial evaluation #prolog #towards
- Towards Just-In-Time Partial Evaluation of Prolog (CFB, ML, AR), pp. 158–172.
- PEPM-2009-LeuschelLOST #csp #named #slicing #specification
- SOC: a slicer for CSP specifications (ML, ML, JO, JS, ST), pp. 165–168.
- SEKE-2009-SamiaL #visualisation
- Pie Tree Visualization (MS, ML), pp. 400–405.
- TestCom-FATES-2009-WieczorekKRLBPS #integration #model checking #modelling #testing
- Applying Model Checking to Generate Model-Based Integration Tests from Choreography Models (SW, VK, AR, ML, JB, DP, IS), pp. 179–194.
- LOPSTR-2008-LeuschelLOST #csp #specification #static analysis
- The MEB and CEB Static Analysis for CSP Specifications (ML, ML, JO, JS, ST), pp. 103–118.
- LOPSTR-2008-LeuschelV #logic programming #partial evaluation #performance #scalability #source code
- Fast Offline Partial Evaluation of Large Logic Programs (ML, GV), pp. 119–134.
- PPDP-2008-Leuschel #declarative #programming #verification
- Declarative programming for verification: lessons and outlook (ML), pp. 1–7.
- IFM-2007-PlaggeL #model checking #specification #using #validation
- Validating Z Specifications Using the ProBAnimator and Model Checker (DP, ML), pp. 480–500.
- PADL-2007-KloseOL #partial evaluation
- Partial Evaluation of Pointcuts (KK, KO, ML), pp. 320–334.
- TAP-2007-SatpathyBLR #automation #specification #testing
- Automatic Testing from Formal Specifications (MS, MJB, ML, SR), pp. 95–113.
- LOPSTR-2006-LeuschelCE #logic programming #online #partial evaluation #source code #using
- Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques (ML, SJC, DE), pp. 43–59.
- PEPM-2006-LeuschelEVCF #interface #web
- The Ecce and Logen partial evaluators and their web interfaces (ML, DE, MV, SJC, MF), pp. 88–94.
- ESOP-2005-LeuschelV #deduction #slicing
- Forward Slicing by Conjunctive Partial Deduction and Argument Filtering (ML, GV), pp. 61–76.
- FM-2005-ButlerL #csp #specification #verification
- Combining CSP and B for Specification and Property Verification (MJB, ML), pp. 221–236.
- PADL-2005-WangGL #code generation #continuation #logic #semantics #towards
- Towards Provably Correct Code Generation via Horn Logical Continuation Semantics (QW, GG, ML), pp. 98–112.
- PPDP-2005-CraigL #prolog #self
- Self-tuning resource aware specialisation for prolog (SJC, ML), pp. 23–34.
- FLOPS-2004-CraigL #effectiveness #named #prolog #self
- LIX: an Effective Self-applicable Partial Evaluator for Prolog (SJC, ML), pp. 85–99.
- LOPSTR-2004-CraigGLH #analysis #automation #prolog
- Fully Automatic Binding-Time Analysis for Prolog (SJC, JPG, ML, KSH), pp. 53–68.
- PDCL-2004-LeuschelCBV #deduction #using
- Specialising Interpreters Using Offline Partial Deduction (ML, SJC, MB, WV), pp. 340–375.
- PDCL-2004-VanhoofBL #analysis
- Binding-Time Analysis for Mercury (WV, MB, ML), pp. 189–232.
- PEPM-2004-BarkerLV #data access #flexibility #logic programming #performance
- Efficient and flexible access control via logic program specialisation (SB, ML, MV), pp. 190–199.
- PPDP-2004-FarwerL #model checking #petri net #prolog
- Model checking object petri nets in prolog (BF, ML), pp. 20–31.
- FME-2003-LeuschelB #model checking #named
- ProB: A Model Checker for B (ML, MJB), pp. 855–874.
- GPCE-2003-ElphickLC #matlab #partial evaluation
- Partial Evaluation of MATLAB (DE, ML, SJC), pp. 344–363.
- LOPSTR-2003-LehmannL #generative #induction #proving #theorem proving #using
- Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce (HL, ML), pp. 1–19.
- FME-2001-LeuschelMC #csp #how #ltl #model checking #refinement
- How to Make FDR Spin LTL Model Checking of CSP by Refinement (ML, TM, AC), pp. 99–118.
- LOPSTR-2001-LeuschelG #deduction #model checking #using
- Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking (ML, SG), pp. 91–110.
- PADL-2001-Leuschel #csp #design #implementation #prolog #specification
- Design and Implementation of the High-Level Specification Language CSP(LP) in Prolog (ML), pp. 14–28.
- CL-2000-LehmannL #calculus #decidability
- Decidability Results for the Propositional Fluent Calculus (HL, ML), pp. 762–776.
- CL-2000-LeuschelL #deduction #petri net
- Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction (ML, HL), pp. 101–115.
- PPDP-2000-LeuschelL #deduction #petri net #problem
- Solving coverability problems of petri nets by partial deduction (ML, HL), pp. 268–279.
- LOPSTR-1999-LeuschelM #abstract interpretation #infinity #model checking
- Infinite State Model Checking by Abstract Interpretation and Program Specialisation (ML, TM), pp. 62–81.
- ESOP-1998-BruynoogheLS #analysis #deduction
- A Polyvariant Binding-Time Analysis for Off-line Partial Deduction (MB, ML, KFS), pp. 27–41.
- JICSLP-1998-Leuschel #abstract interpretation
- Program Specialisation and Abstract Interpretation Reconciled (ML), pp. 220–234.
- LOPSTR-1998-Leuschel #online #termination
- Improving Homeomorphic Embedding for Online Termination (ML), pp. 199–218.
- SAS-1998-Leuschel #on the #online #power of #termination
- On the Power of Homeomorphic Embedding for Online Termination (ML), pp. 230–245.
- LOPSTR-1997-DecorteSLMS #analysis #logic programming #termination
- Termination Analysis for Tabled Logic Programming (SD, DDS, ML, BM, KFS), pp. 111–127.
- LOPSTR-1997-LeuschelMS #logic programming #source code #termination
- Preserving Termination of Tabled Logic Programs While Unfolding (ML, BM, KFS), pp. 189–205.
- JICSLP-1996-LeuschelSW #concept #deduction #integration #towards
- A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration (ML, DDS, DAdW), pp. 319–332.
- LOPSTR-1996-JorgensenLM #deduction
- Conjunctive Partial Deduction in Practice (JJ, ML, BM), pp. 59–82.
- LOPSTR-1996-LeuschelS #how #logic programming
- Logic Program Specialisation: How to Be More Specific (ML, DDS), p. 58.
- LOPSTR-1996-LeuschelS96a #logic programming #source code
- Redundant Argument Filtering of Logic Programs (ML, MHS), pp. 83–103.
- PLILP-1996-LeuschelS #how #logic programming
- Logic Program Specialisation: How To Be More Specific (ML, DDS), pp. 137–151.
- ILPS-1995-LeuschelM #deduction #representation
- Partial Deduction of the Ground Representation and its Application to Integrity Checking (ML, BM), pp. 495–509.
- ILPS-1995-SchreyeLM #tutorial
- Tutorial on Program Specialisation (DDS, ML, BM), pp. 615–616.
- LOPSTR-1995-Leuschel #constraints #deduction
- Ecological Partial Deduction: Preserving Characteristic Trees Without Constraints (ML), pp. 1–16.
- PEPM-1995-LeuschelS #partial evaluation #towards
- Towards Creating Specialised Integrity Checks through Partial Evaluation of Meta-Interpreters (ML, DDS), pp. 253–263.
- LOPSTR-1994-Leuschel #partial evaluation
- Partial Evaluation of the “Real Thing” (ML), pp. 122–137.