BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
μ-calculus
Google μ-calculus

Tag #μ-calculus

85 papers:

CIAACIAA-2017-CauliP #calculus #equivalence #probability
Equivalence of Probabilistic μ-Calculus and p-Automata (CC, NP), pp. 64–75.
RTARTA-TLCA-2014-NakazawaN #reduction #λ-calculus
Reduction System for Extensional Λμ Calculus (KN, TN), pp. 349–363.
FoSSaCSFoSSaCS-2014-Mio #calculus #similarity
Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus (MM), pp. 335–350.
LICSLICS-CSL-2014-BojanczykDK #calculus #composition #model checking #theorem
Decomposition theorems and model-checking for the modal μ-calculus (MB, CD, SK), p. 10.
RTARTA-2013-GrabmayerR #λ-calculus
Expressibility in the λ Calculus with μ (CG, JR), pp. 206–222.
FASEFASE-2013-BradfieldS #calculus #game studies #qvt
Enforcing QVT-R with μ-Calculus and Games (JCB, PS), pp. 282–296.
CSLCSL-2013-AfshariL #calculus #on the
On closure ordinals for the modal μ-calculus (BA, GEL), pp. 30–44.
LICSLICS-2013-FacchiniVZ #calculus #theorem
A Characterization Theorem for the Alternation-Free Fragment of the Modal μ-Calculus (AF, YV, FZ), pp. 478–487.
FASEFASE-2012-BradfieldS #calculus #qvt #recursion
Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal μ Calculus (JCB, PS), pp. 194–208.
ICALPICALP-v2-2011-FischerK #calculus #hybrid #linear #model checking
Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems (DF, LK), pp. 404–415.
TLCATLCA-2011-BakelBd #λ-calculus
A Filter Model for the λμ-Calculus — (SvB, FB, Ud), pp. 213–228.
FoSSaCSFoSSaCS-2011-Mio #calculus #independence #probability
Probabilistic Modal μ-Calculus with Independent Product (MM), pp. 290–304.
SEFMSEFM-2010-GallardoS #calculus #verification
Verification of Dynamic Data Tree with μ-calculus Extended with Separation (MdMG, DS), pp. 211–221.
FLOPSFLOPS-2010-Saurin #standard #λ-calculus
Standardization and Böhm Trees for λμ-Calculus (AS), pp. 134–149.
ICGTICGT-2010-GadducciLV #calculus #higher-order #semantics
Counterpart Semantics for a Second-Order μ-Calculus (FG, ALL, AV), pp. 282–297.
FoSSaCSFoSSaCS-2010-CateF #calculus #finite #proving
An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees (BtC, GF), pp. 161–175.
DLTDLT-2009-Meinecke #calculus #word
A Weighted μ-Calculus on Words (IM), pp. 384–395.
ICALPICALP-v2-2009-KobayashiO #calculus #complexity #model checking #recursion
Complexity of Model Checking Recursion Schemes for Fragments of the Modal μ-Calculus (NK, CHLO), pp. 223–234.
CSLCSL-2009-CirsteaKP #algebra #calculus
EXPTIME Tableaux for the Coalgebraic μ-Calculus (CC, CK, DP), pp. 179–193.
LICSLICS-2009-KobayashiO #calculus #higher-order #model checking #recursion #type system
A Type System Equivalent to the Modal μ-Calculus Model Checking of Higher-Order Recursion Schemes (NK, CHLO), pp. 179–188.
CSLCSL-2008-ColcombetL #calculus #problem
The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (TC, CL), pp. 416–430.
CSLCSL-2008-Fontaine #calculus
Continuous Fragment of the μ-Calculus (GF), pp. 139–153.
CSLCSL-2008-Saurin #on the #λ-calculus
On the Relations between the Syntactic Theories of λμ-Calculi (AS), pp. 154–168.
RTARTA-2007-Tatsuta #λ-calculus
The Maximum Length of μ-Reduction in λμ-Calculus (MT), pp. 359–373.
TLCATLCA-2007-Vaux #λ-calculus
Convolution λμ-Calculus (LV), pp. 381–395.
FoSSaCSFoSSaCS-2007-FerranteM #calculus
Enriched μ-Calculi Module Checking (AF, AM), pp. 183–197.
LICSLICS-2007-JurdzinskiL #calculus
Alternation-free modal μ-calculus for data trees (MJ, RL), pp. 131–140.
ICALPICALP-v2-2006-BonattiLMV #calculus #complexity
The Complexity of Enriched μ-Calculi (PAB, CL, AM, MYV), pp. 540–551.
QAPLQAPL-2005-McIverM06 #calculus #game studies #novel #probability
A Novel Stochastic Game Via the Quantitative μ-calculus (AM, CM), pp. 195–212.
FoSSaCSFoSSaCS-2006-Rohde #calculus #on the
On the μ-Calculus Augmented with Sabotage (PR), pp. 142–156.
CSLCSL-2006-ScheweF #calculus #finite #satisfiability
Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus (SS, BF), pp. 591–605.
LICSLICS-2006-Lassen #bisimulation #normalisation #λ-calculus
Head Normal Form Bisimulation for Pairs and the λμ-Calculus (SBL), pp. 297–306.
FMFM-2005-Bosnacki #abstraction #calculus #on the
On Some Galois Connection Based Abstractions for the μ-Calculus (DB), pp. 366–381.
RTARTA-2005-Rocheteau #call-by #λ-calculus
λμ-Calculus and Duality: Call-by-Name and Call-by-Value (JR), pp. 204–218.
TLCATLCA-2005-DavidN #normalisation #proving #symmetry #λ-calculus
Arithmetical Proofs of Strong Normalization Results for the Symmetric λμ-Calculus (RD, KN), pp. 162–178.
SEKESEKE-2005-IzadiM #algorithm #calculus #model checking #performance
An Efficient Model Checking Algorithm for a Fragment of μ-Calculus (MI, AMR), pp. 392–395.
WRLAWRLA-2004-Wang05 #calculus #maude #model checking
μ-Calculus Model Checking in Maude (BYW), pp. 135–152.
CSLCSL-2005-BradfieldDQ #calculus
Transfinite Extension of the μ-Calculus (JCB, JD, SQ), pp. 384–396.
LICSLICS-2005-Saurin #λ-calculus
Separation with Streams in the λμ-calculus (AS), pp. 356–365.
FoSSaCSFoSSaCS-2004-Polonovski #calculus #normalisation
Strong Normalization of λμμ-Calculus with Explicit Substitutions (EP), pp. 423–437.
TLCATLCA-2003-Fujita #λ-calculus
A Sound and Complete CPS-Translation for λμ-Calculus (KeF), pp. 120–134.
FoSSaCSFoSSaCS-2003-ArnoldS #ambiguity #calculus #game studies
Ambiguous Classes in the Games μ-Calculus Hierarchy (AA, LS), pp. 70–86.
FoSSaCSFoSSaCS-2003-SprengerD #calculus #induction #on the #proving #reasoning
On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the μ-Calculus (CS, MD), pp. 425–440.
TACASTACAS-2003-HenzingerKM #calculus #on the
On the Universal and Existential Fragments of the μ-Calculus (TAH, OK, RM), pp. 49–64.
CAVCAV-2003-Obdrzalek #bound #calculus #model checking #performance
Fast μ-Calculus Model Checking when Tree-Width Is Bounded (JO), pp. 80–92.
FASEFASE-2002-BradfieldFS #calculus #ocl #using
Enriching OCL Using Observational μ-Calculus (JCB, JKF, PS), pp. 203–217.
TACASTACAS-2002-Mateescu #calculus #lts #model checking
Local Model-Checking of Modal μ-Calculus on Acyclic Labeled Transition Systems (RM), pp. 281–295.
CSLCSL-2002-BerwangerGL #calculus #on the
On the Variable Hierarchy of the Modal μ-Calculus (DB, EG, GL), pp. 352–366.
CSLCSL-2002-Niwinski #calculus #game studies
μ-Calculus via Games (DN), pp. 27–43.
TLCATLCA-2001-Matthes #higher-order #induction #λ-calculus
Parigot’s Second Order λμ-Calculus and Inductive Types (RM), pp. 329–343.
PADLPADL-2001-Ramakrishnan #calculus #logic programming #model checking #using
A Model Checker for Value-Passing μ-Calculus Using Logic Programming (CRR), pp. 1–13.
TACASTACAS-2001-BolligLW #calculus #model checking #parallel
Parallel Model Checking for the Alternation Free μ-Calculus (BB, ML, MW), pp. 543–558.
CAVCAV-2001-GrumbergHS #calculus #distributed #model checking
Distributed Symbolic Model Checking for μ-Calculus (OG, TH, AS), pp. 350–362.
LICSLICS-2001-JaninL #calculus #monad
Relating Levels of the μ-Calculus Hierarchy and Levels of the Monadic Hierarchy (DJ, GL), pp. 347–356.
ICALPICALP-1999-Miculan #calculus #formal method #induction #lazy evaluation #proving
Formalizing a Lazy Substitution Proof System for μ-calculus in the Calculus of Inductive Constructions (MM), pp. 554–564.
TLCATLCA-1999-Fujita #call-by #morphism #polymorphism #λ-calculus
Explicitly Typed λμ-Calculus for Polymorphism an Call-by-Value (KeF), pp. 162–176.
FoSSaCSFoSSaCS-1999-NarasimhaCI #calculus #logic #probability
Probabilistic Temporal Logics via the Modal μ-Calculus (MN, RC, SPI), pp. 288–305.
TACASTACAS-1998-Sprenger #calculus #coq #model checking
A Verified Model Checker for the Modal μ-calculus in Coq (CS), pp. 167–183.
LICSLICS-1998-CharatonikMNPW #calculus
The Horn μ-calculus (WC, DAM, DN, AP, IW), pp. 58–69.
ICALPICALP-1997-BurkartS #calculus #infinity #model checking #process
Model Checking the Full Modal μ-Calculus for Infinite Sequential Processes (OB, BS), pp. 419–429.
CAVCAV-1997-Biere #calculus #model checking #named #performance
μcke — Efficient μ-Calculus Model Checking (AB), pp. 468–471.
CAVCAV-1997-PardoH #abstraction #automation #calculus #model checking
Automatic Abstraction Techniques for Propositional μ-calculus Model Checking (AP, GDH), pp. 12–23.
LICSLICS-1997-HofmannS #continuation #modelling #λ-calculus
Continuation Models are Universal for λμ-Calculus (MH, TS), pp. 387–395.
ICALPICALP-1996-BradfieldEM #calculus #effectiveness #linear
An Effective Tableau System for the Linear Time μ-Calculus (JCB, JE, AM), pp. 98–109.
ICALPICALP-1996-Lenzi #calculus #theorem
A Hierarchy Theorem for the μ-Calculus (GL), pp. 87–97.
WRLARWLW-1996-Lechner #calculus #distributed #maude #object-oriented #specification
Object-oriented specifications of distributed systems in the μ-Calculus and Maude (UL), pp. 385–404.
TACASTACAS-1996-BhatC #calculus #model checking
Efficent Local Model-Checking for Fragments of teh Modal μ-Calculus (GB, RC), pp. 107–126.
TACASTACAS-1996-Stirling #calculus #game studies
Games and Modal μ-Calculus (CS), pp. 298–312.
LICSLICS-1996-BhatC #calculus #equation #model checking #performance
Efficient Model Checking via the Equational μ-Calculus (GB, RC), pp. 304–312.
LICSLICS-1996-Seidl #calculus
A Modal μ-Calculus for Durational Transition Systems (HS), pp. 128–137.
TACASTACAS-1995-Mader #calculus #model checking
Modal μ-Calculus, Model Checking and Gauß Elimination (AM), pp. 72–88.
CAVCAV-1995-Emerson #calculus #model checking #tutorial
Methods for μ-calculus Model Checking: A Tutorial (EAE), p. 141.
CAVCAV-1995-Rauzy #calculus #constraints
Toupie = μ-Calculus + Constraints (AR), pp. 114–126.
LICSLICS-1995-Walukiewicz #axiom #calculus
Completeness of Kozen’s Axiomatisation of the Propositional μ-Calculus (IW), pp. 14–24.
CAVCAV-1994-SokolskyS #calculus #incremental #model checking
Incremental Model Checking in the Modal μ-Calculus (OS, SAS), pp. 351–363.
LICSLICS-1994-AndersenSW #calculus #composition #proving
A Compositional Proof System for the Modal μ-Calculus (HRA, CS, GW), pp. 144–153.
LICSLICS-1994-ZhangSS #calculus #complexity #model checking #on the #parallel
On the Parallel Complexity of Model Checking in the Modal μ-Calculus (SZ, OS, SAS), pp. 154–163.
CAVCAV-1993-EmersonJS #calculus #model checking #on the
On Model-Checking for Fragments of μ-Calculus (EAE, CSJ, APS), pp. 385–396.
CSLCSL-1993-AmblerKM #calculus #on the
On Duality for the Modal μ-Calculus (SA, MZK, NM), pp. 18–32.
SASWSA-1992-CorsiniMR #calculus #finite #prolog #semantics
The μ-Calculus over Finite Domains as an Abstract Semantics of Prolog (MMC, KM, AR), pp. 51–59.
CAVCAV-1992-CleavelandKS #calculus #model checking #performance
Faster Model Checking for the Modal μ-Calculus (RC, MK, BS), pp. 410–422.
CAVCAV-1991-CleavelandS #algorithm #calculus #linear #model checking
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal μ-Calculus (RC, BS), pp. 48–58.
LICSLICS-1986-EmersonL #calculus #model checking #performance
Efficient Model Checking in Fragments of the Propositional μ-Calculus (EAE, CLL), pp. 267–278.
ICALPICALP-1984-StreettE #calculus
The Propositional μ-Calculus is Elementary (RSS, EAE), pp. 465–472.
ICALPICALP-1982-Kozen #calculus
Results on the Propositional μ-Calculus (DK), pp. 348–359.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.