BibSLEIGH — axiom tag

axiom

axiom

Tag #axiom

216 papers:

CSL-2020-Brunet #algebra: A Complete Axiomatisation of a Fragment of Language Algebra (PB), p. 15.
FM-2019-TanP #approach #difference #equation #liveness: An Axiomatic Approach to Liveness for Differential Equations (YKT, AP), pp. 371–388.
IFM-2019-BoerH #concurrent #reachability: Axiomatic Characterization of Trace Reachability for Concurrent Objects (FSdB, HDAH), pp. 157–174.
ECIR-p1-2019-RenningsMH #approach #information retrieval #modelling: An Axiomatic Approach to Diagnosing Neural IR Models (DR, FM, CH), pp. 489–503.
ECIR-p1-2019-YangL #information retrieval #semantics: Reproducing and Generalizing Semantic Term Matching in Axiomatic Information Retrieval (PY, JL), pp. 369–381.
ECIR-p2-2019-ImaniVMS #ad hoc #order #query #retrieval: An Axiomatic Study of Query Terms Order in Ad-Hoc Retrieval (AI, AV, AM, AS), pp. 196–202.
KDD-2019-ZhangTKLCC #modelling #multi: Axiomatic Interpretability for Multiclass Additive Models (XZ, ST, PK, YL, UC, RC), pp. 226–234.
CADE-2019-FurbachKS #word: Names Are Not Just Sound and Smoke: Word Embeddings for Axiom Selection (UF, TK, CS), pp. 250–268.
FSCD-2018-HadzihasanovicF #diagrams #quantum: A Diagrammatic Axiomatisation of Fermionic Quantum Circuits (AH, GdF, KFN), p. 20.
ICPR-2018-BandyopadhyayNM #network #social: A Generic Axiomatic Characterization for Measuring Influence in Social Networks (SB, RN, MNM), pp. 2606–2611.
LOPSTR-2018-AlpuenteCEM #commutative: Homeomorphic Embedding Modulo Combinations of Associativity and Commutativity Axioms (MA, ACO, SE, JM), pp. 38–55.
POPL-2018-KoH #bidirectional #programming: An axiomatic basis for bidirectional programming (HSK, ZH), p. 29.
POPL-2018-PulteFDFSS #concurrent #modelling #multi: Simplifying ARM concurrency: multicopy-atomic axiomatic and operational models for ARMv8 (CP, SF, WD, JF, SS, PS), p. 29.
TAP-2018-LoulergueBK #execution #specification: Ghosts for Lists: From Axiomatic to Executable Specifications (FL, AB, NK), pp. 177–184.
ICML-2017-SundararajanTY #network: Axiomatic Attribution for Deep Networks (MS, AT, QY), pp. 3319–3328.
OOPSLA-2017-AnconaDZ #reasoning: Reasoning on divergent computations with coaxioms (DA, FD, EZ), p. 26.
PPDP-2017-AguirreMPP #smt: Conditional narrowing modulo SMT and axioms (LA, NMO, MP, IP), pp. 17–28.
ESOP-2017-AnconaDZ: Generalizing Inference Systems by Coaxioms (DA, FD, EZ), pp. 29–55.
CIKM-2016-HagenVGS #ranking: Axiomatic Result Re-Ranking (MH, MV, SG, BS0), pp. 721–730.
ICML-2016-GaoKOV #capacity #dependence: Conditional Dependence via Shannon Capacity: Axioms, Estimators and Applications (WG, SK, SO, PV), pp. 2780–2789.
ICPR-2016-BandyopadhyayM #clustering #incremental #performance: Axioms to characterize efficient incremental clustering (SB, MNM), pp. 450–455.
LOPSTR-2016-AlpuenteCEM #equation #order #partial evaluation #source code: Partial Evaluation of Order-Sorted Equational Programs Modulo Axioms (MA, ACO, SE, JM), pp. 3–20.
CSL-2016-Luck #logic: Axiomatizations for Propositional and Modal Team Logic (ML), p. 18.
CSL-2016-OrtonP #modelling #type system: Axioms for Modelling Cubical Type Theory in a Topos (IO, AMP), p. 19.
FM-2015-SchmittU #first-order #logic: Axiomatization of Typed First-Order Logic (PHS, MU), pp. 470–486.
ICML-2015-PrasadPR #analysis #rank: Distributional Rank Aggregation, and an Axiomatic Analysis (AP, HHP, PDR), pp. 2104–2112.
CADE-2015-FultonMQVP #hybrid #proving #theorem proving: KeYmaera X: An Axiomatic Tactical Theorem Prover for Hybrid Systems (NF, SM, JDQ, MV, AP), pp. 527–538.
CAV-2015-ManskyGZ #memory management #modelling #specification: An Axiomatic Specification for Sequential Memory Models (WM, DG, SZ), pp. 413–428.
CSL-2015-SanoV #dependence #logic: Axiomatizing Propositional Dependence Logics (KS, JV), pp. 292–307.
LICS-2015-DasR #infinity: A Complete Axiomatization of MSO on Infinite Trees (AD, CR), pp. 390–401.
LICS-2015-Hadzihasanovic #diagrams #quantum: A Diagrammatic Axiomatisation for Qubit Entanglement (AH), pp. 573–584.
SAT-2015-ArifMM #performance: Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (MFA, CM, JMS), pp. 324–342.
ICALP-v2-2014-AvinBLP #design #distributed #network: Distributed Computing on Core-Periphery Networks: Axiom-Based Design (CA, MB, ZL, DP), pp. 399–410.
CIKM-2014-RahimiSK #analysis #information retrieval: Axiomatic Analysis of Cross-Language Information Retrieval (RR, AS, IK), pp. 1875–1878.
KEOD-2014-PintoA #case study #validation: An e-Government Project Case Study — Interview based DEMO Axioms’ Benefits Validation (DP, DA), pp. 138–149.
KR-2014-Aucher #interactive: Axioms .2 and .4 as Interaction Axioms (GA).
KR-2014-BjorndahlHP: Axiomatizing Rationality (AB, JYH, RP).
KR-2014-Lin14a #first-order #higher-order #induction #semantics: A First-Order Semantics for Golog and ConGolog under a Second-Order Induction Axiom for Situations (FL).
SIGIR-2014-FangZ #analysis #information retrieval #modelling #optimisation: Axiomatic analysis and optimization of information retrieval models (HF, CZ), p. 1288.
POPL-2014-Krebbers #c #nondeterminism #semantics #sequence: An operational and axiomatic semantics for non-determinism and sequence points in C (RK), pp. 101–112.
FoSSaCS-2014-DArgenioGL #bisimulation #metric #probability: Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules (PRD, DG, MDL), pp. 289–303.
IJCAR-2014-HorbachS #locality #reachability: Locality Transfer: From Constrained Axiomatizations to Reachability Predicates (MH, VSS), pp. 192–207.
IJCAR-2014-Lellmann #strict #theory and practice: Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications (BL), pp. 307–321.
LICS-CSL-2014-Ilik #decidability #morphism: Axioms and decidability for type isomorphism in the presence of sums (DI), p. 7.
HIMI-LCCB-2013-GuoZSP #usability: Value Added by the Axiomatic Usability Method for Evaluating Consumer Electronics (YG, YZ, GS, RWP), pp. 457–466.
CSL-2013-Materzok #continuation: Axiomatizing Subtyped Delimited Continuations (MM), pp. 521–539.
ICALP-v2-2012-RosuS #formal method #semantics #towards: Towards a Unified Theory of Operational and Axiomatic Semantics (GR, AS), pp. 351–363.
RTA-2012-Balabonski: Axiomatic Sharing-via-Labelling (TB), pp. 85–100.
ECIR-2012-KarimzadehganZ #analysis #information retrieval: Axiomatic Analysis of Translation Language Model for Information Retrieval (MK, CZ), pp. 268–280.
KR-2012-WilsonM #diagrams #framework #order: An Axiomatic Framework for Influence Diagram Computation with Partially Ordered Utilities (NW, RM).
WRLA-2012-GutierrezMR #order #similarity: Order-Sorted Equality Enrichments Modulo Axioms (RG, JM, CR), pp. 162–181.
CAV-2012-Mador-HaimMSMAOAMSW #memory management #multi: An Axiomatic Memory Model for POWER Multiprocessors (SMH, LM, SS, KM, JA, SO, RA, MMKM, PS, DW), pp. 495–512.
CSL-2012-Aschieri #interactive: Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms (FA), pp. 31–45.
CSL-2012-Hida: A Computational Interpretation of the Axiom of Determinacy in Arithmetic (TH), pp. 335–349.
CSL-2012-Kuroda #bound #concept #proving: Axiomatizing proof tree concepts in Bounded Arithmetic (SK), pp. 440–454.
SMT-2012-ConchonMRI #float #smt: Built-in Treatment of an Axiomatic Floating-Point Theory for SMT Solvers (SC, GM, CR, MI), pp. 12–21.
RTA-2011-SeveriV #λ-calculus: Weakening the Axiom of Overlap in Infinitary λ Calculus (PS, FJdV), pp. 313–328.
DUXU-v2-2011-UangLC #approach #design: A Product Design Approach by Integrating Axiomatic Design and TRIZ (STU, CLL, MC), pp. 225–233.
HCI-DDA-2011-LiangL #design: Axiomatic Design for Biometric Icons (SFML, CTL), pp. 98–106.
HIMI-v1-2011-GuoPS #concept #evaluation #usability: A Conceptual Model of the Axiomatic Usability Evaluation Method (YG, RWP, GS), pp. 93–102.
CIKM-2011-ChengQ #algorithm #incremental: An algorithm for axiom pinpointing in EL+ and its incremental variant (XC, GQ), pp. 2433–2436.
KDD-2011-JinLH #network #ranking #similarity: Axiomatic ranking of network role similarity (RJ, VEL, HH), pp. 922–930.
POPL-2011-HengleinN #induction #regular expression: Regular expression containment: coinductive axiomatization and computational interpretation (FH, LN), pp. 385–398.
PPDP-2011-SchernhammerM #incremental #recursion #specification: Incremental checking of well-founded recursive specifications modulo axioms (FS, JM), pp. 5–16.
SAC-2011-BoscP #flexibility #fuzzy #on the #retrieval: On three fuzzy connectives for flexible data retrieval and their axiomatization (PB, OP), pp. 1114–1118.
SAC-2011-KasemGI: Origami axioms and circle extension (AK, FG, TI), pp. 1106–1111.
GPCE-J-2009-BaggeDH11 #c++ #testing: Testing with Axioms in C++ 2011 (AHB, VD, MH), pp. 239–270.
CSL-2011-CardelliLM #logic #markov #metric: Continuous Markovian Logic — From Complete Axiomatization to the Metric Space of Formulas (LC, KGL, RM), pp. 144–158.
CSL-2011-MoreNS #concurrent #independence #semantics: Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence (SMM, PN, BS), pp. 443–457.
CSL-2011-Polonsky: Axiomatizing the Quote (AP), pp. 458–469.
ICLP-2011-Wilson #implementation: Implementation of Axiomatic Language (WWW), pp. 290–295.
VMCAI-2011-JacobsK #reasoning #specification #towards: Towards Complete Reasoning about Axiomatic Specifications (SJ, VK), pp. 278–293.
PODS-2010-KiferL #privacy #statistics #towards: Towards an axiomatization of statistical privacy and utility (DK, BRL), pp. 147–158.
FLOPS-2010-AlvezL #similarity #strict: A Complete Axiomatization of Strict Equality (JÁ, FJLF), pp. 118–133.
KR-2010-PenalozaS #complexity #logic #on the #product line: On the Complexity of Axiom Pinpointing in the EL Family of Description Logics (RP, BS).
OOPSLA-2010-DilligDA #abstraction #invariant #memory management: Symbolic heap abstraction with demand-driven axiomatization of memory invariants (ID, TD, AA), pp. 397–410.
PLDI-2010-TorlakVD #memory management #modelling #named #specification: MemSAT: checking axiomatic specifications of memory models (ET, MV, JD), pp. 341–350.
PPDP-2010-KameyamaT #call-by #equation: Equational axiomatization of call-by-name delimited control (YK, AT), pp. 77–86.
IJCAR-2010-Aderhold #automation #higher-order #induction #recursion #source code #synthesis: Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion (MA), pp. 263–277.
IJCAR-2010-Kazakov #logic: An Extension of Complex Role Inclusion Axioms in the Description Logic SROIQ (YK), pp. 472–486.
TAP-2010-AhnD #first-order #logic #testing #verification: Testing First-Order Logic Axioms in Program Verification (KYA, ED), pp. 22–37.
LDTA-2008-BaggeH09 #optimisation #testing: Axiom-Based Transformations: Optimisation and Testing (AHB, MH), pp. 17–33.
GPCE-2009-BaggeDH #c++ #concept #testing: The axioms strike back: testing with concepts and axioms in C++ (AHB, VD, MH), pp. 15–24.
STOC-2009-ImpagliazzoKK #approach: An axiomatic approach to algebrization (RI, VK, AK), pp. 695–704.
CADE-2009-RoedererPS #named: Divvy: An ATP Meta-system Based on Axiom Relevance Ordering (AR, YP, GS), pp. 157–162.
CADE-2009-SebastianiV #analysis #encoding #lightweight #logic: Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis (RS, MV), pp. 84–99.
KR-2008-BaaderGL #logic #ltl: LTL over Description Logic Axioms (FB, SG, CL), pp. 684–694.
KR-2008-SimariBSK: Promises Kept, Promises Broken: An Axiomatic and Quantitative Treatment of Fulfillment (GIS, MB, VSS, SK), pp. 59–69.
ASE-2008-RakamaricH #automation #static analysis #using: Automatic Inference of Frame Axioms Using Static Analysis (ZR, AJH), pp. 89–98.
CSL-2008-HermantL #approach #semantics: A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms (OH, JL), pp. 169–183.
CSL-2008-HodkinsonMS #logic: Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T (IMH, AM, GS), pp. 308–322.
IJCAR-2008-BaaderP: Automata-Based Axiom Pinpointing (FB, RP), pp. 226–241.
LICS-2008-ChenF #equivalence #on the: On the Axiomatizability of Impossible Futures: Preorder versus Equivalence (TC, WF), pp. 156–165.
LICS-2008-CiabattoniGT #logic: From Axioms to Analytic Rules in Nonclassical Logics (AC, NG, KT), pp. 229–240.
LICS-2008-Moschovakis #bound: The Axiomatic Derivation of Absolute Lower Bounds (YNM), p. 405.
HCI-IDU-2007-Yenisey #approach #design #web: Axiomatic Design Approach for E-Commercial Web Sites (MMY), pp. 308–315.
SAC-2007-GhourabiITMK #algebra #logic: Logical and algebraic view of Huzita’s origami axioms with applications to computational origami (FG, TI, HT, MM, AK), pp. 767–772.
ESOP-2007-CenciarelliKS #java #memory management: The Java Memory Model: Operationally, Denotationally, Axiomatically (PC, AK, ES), pp. 331–346.
CADE-2007-SutcliffeP #named #semantics: SRASS — A Semantic Relevance Axiom Selection System (GS, YP), pp. 295–310.
LICS-2007-CohenD #encryption: A Complete Axiomatization of Knowledge and Cryptography (MC, MD), pp. 77–88.
ICALP-v2-2006-AcetoCFI #on the: On the Axiomatizability of Priority (LA, TC, WF, AI), pp. 480–491.
SIGIR-2006-FangZ #information retrieval #semantics: Semantic term matching in axiomatic approaches to information retrieval (HF, CZ), pp. 115–122.
IJCAR-2006-HendrixMO #linear #order #specification: A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms (JH, JM, HO), pp. 151–155.
ICML-2005-Meila #clustering #perspective: Comparing clusterings: an axiomatic view (MM), pp. 577–584.
SIGIR-2005-FangZ #information retrieval: An exploration of axiomatic approaches to information retrieval (HF, CZ), pp. 480–487.
FoSSaCS-2005-DengP #behaviour #finite #probability: Axiomatizations for Probabilistic Finite-State Behaviors (YD, CP), pp. 110–124.
CAV-2005-McPeakN #data type #similarity #specification: Data Structure Specifications via Local Equality Axioms (SM, GCN), pp. 476–490.
CSL-2005-BrattkaS #sequence: Computing with Sequences, Weak Topologies and the Axiom of Choice (VB, MS), pp. 462–476.
FATES-2005-AiguierABGM #algebra #specification #testing: Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms (MA, AA, CB, PLG, BM), pp. 203–217.
FLOPS-2004-Ogawa #algebra #graph: Complete Axiomatization of an Algebraic Construction of Graphs (MO), pp. 163–179.
KR-2004-CondottaL #calculus: Axiomatizing the Cyclic Interval Calculus (JFC, GL), pp. 95–105.
CSL-2004-Kameyama #continuation: Axioms for Delimited Continuations in the CPS Hierarchy (YK), pp. 442–457.
ICALP-2003-BlomFN #on the #simulation: On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces (SB, WF, SN), pp. 109–118.
ICALP-2003-Hannay #data type #higher-order: Axiomatic Criteria for Quotients and Subobjects for Higher-Order Data Types (JEH), pp. 903–917.
ICFP-2003-KameyamaH #continuation: A sound and complete axiomatization of delimited continuations (YK, MH), pp. 177–188.
CADE-2003-Nivelle #first-order #proving: Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms (HdN), pp. 365–379.
CADE-2003-SchmidtH #first-order: A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae (RAS, UH), pp. 412–426.
ICALP-2002-ImpagliazzoS #bound #simulation: Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations (RI, NS), pp. 208–219.
ICALP-2002-LohreyDH: Axiomatising Divergence (ML, PRD, HH), pp. 585–596.
RTA-2002-Mellies #revisited: Axiomatic Rewriting Theory VI Residual Theory Revisited (PAM), pp. 24–50.
KR-2002-RandellW #composition #scalability: Building Large Composition Tables via Axiomatic Theories (DAR, MW), pp. 26–36.
DLT-2001-Kuske #set: Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable (DK), pp. 206–216.
ICALP-2001-BandiniS #bisimulation #probability: Axiomatizations for Probabilistic Bisimulation (EB, RS), pp. 370–381.
ICALP-2001-HonsellMS #algebra #approach: An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS (FH, MM, IS), pp. 963–978.
FLOPS-J2-1998-Hinze01 #functional #implementation #prolog: Prolog’s Control Constructs in a Functional Setting — Axioms and Implementation (RH), pp. 125–170.
FoSSaCS-2001-AcetoEI: Axiomatizing Tropical Semirings (LA, ZÉ, AI), pp. 42–56.
FoSSaCS-2001-HasegawaK #call-by #recursion: Axioms for Recursion in Call-by-Value (MH, YK), pp. 246–260.
FoSSaCS-2001-Tini #semantics: An Axiomatic Semantics for the Synchronous Language Gentzen (ST), pp. 394–409.
ICALP-2000-BravettiG #behaviour #congruence #finite: A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors (MB, RG), pp. 744–755.
KR-2000-HorrocksT #reasoning #theory and practice: Reasoning with Axioms: Theory and Practice (IH, ST), pp. 285–296.
CSL-2000-Esik #fixpoint: Axiomatizing the Least Fixed Point Operation and Binary Supremum (ZÉ), pp. 302–316.
LICS-2000-Moszkowski #infinity #logic: A Complete Axiomatization of Interval Temporal Logic with Infinite Time (BCM), pp. 241–252.
LICS-2000-SimpsonP #category theory #fixpoint: Complete Axioms for Categorical Fixed-Point Operators (AKS, GDP), pp. 30–41.
TLCA-1999-DybjerS #finite #recursion: A Finite Axiomatization of Inductive-Recursive Definitions (PD, AS), pp. 129–146.
LICS-1999-Simpson #category theory: Elementary Axioms for Categories of Classes (AKS), pp. 77–85.
ICALP-1998-GadducciM #process: Axioms for Contextual Net Processes (FG, UM), pp. 296–308.
ICALP-1998-TahaBS #multi #programming #type safety: Multi-Stage Programming: Axiomatization and Type Safety (WT, ZEAB, TS), pp. 918–929.
FLOPS-1998-Hinze #functional #implementation #prolog: Prological Features in a Functional Setting Axioms and Implementation (RH), pp. 98–122.
FoSSaCS-1998-AcetoFI #equation: A Cook’s Tour of Equational Axiomatizations for Prefix Iteration (LA, WF, AI), pp. 20–34.
LICS-1998-FioreH #game studies #process #recursion #representation: Recursive Types in Games: Axiomatics and Process Representation (MPF, KH), pp. 345–356.
LICS-1998-JohnstonePTWW #algebra #category theory: An Axiomatics for Categories of Transition Systems as Coalgebras (PJ, JP, TT, HW, JW), pp. 207–213.
ICALP-1997-Fokkink #algebra #process: Axiomatizations for the Perpetual Loop in Process Algebra (WF), pp. 571–581.
RTA-1997-BechetGR #partial order: A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders (DB, PdG, CR), pp. 230–240.
TLCA-1997-BrandtH #induction #recursion #similarity #type system: Coinductive Axiomatization of Recursive Type Equality and Subtyping (MB, FH), pp. 63–81.
TLCA-1997-Takeuti #parametricity: An Axiomatic System of Parametricity (IT), pp. 354–372.
ICFP-1997-LaunchburyS #monad #type safety: Monadic State: Axiomatization and Type Safety (JL, AS), pp. 227–238.
CSL-1997-Hollenberg #algebra #equation: Equational Axioms of Test Algebra (MH), pp. 295–310.
LICS-1997-FiorePP #set: Complete Cuboidal Sets in Axiomatic Domain Theory (MPF, GDP, AJP), pp. 268–278.
ICALP-1996-ChengK #constraints #set: A Complete Gentzen-Style Axiomatization for Set Constraints (AC, DK), pp. 134–145.
ESOP-1996-FradetCM #algorithm #detection #fault #pointer #static analysis: Static Detection of Pointer Errors: An Axiomatisation and a Checking Algorithm (PF, RC, DLM), pp. 125–140.
CADE-1996-Salzer #multi #quantifier: Optimal Axiomatizations for Multiple-Valued Operators and Quantifiers Based on Semi-lattices (GS), pp. 688–702.
CSL-1996-FioreP #modelling: An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory (MPF, GDP), pp. 129–149.
ICDAR-v1-1995-JonkS #approach #clustering: An axiomatic approach to clustering line-segments (AJ, AWMS), pp. 386–389.
ICALP-1995-EsikB #equation: Nonfinite Axiomatizability of the Equational Theory of Shuffle (ZÉ, MB), pp. 27–38.
TLCA-1995-BerardiBC: A realization of the negative interpretation of the Axiom of Choice (SB, MB, TC), pp. 47–62.
TAPSOFT-1995-BloomE: Nonfinite Axiomatizability of Shuffle Inequalities (SLB, ZÉ), pp. 318–333.
LICS-1995-Walukiewicz #calculus #μ-calculus: Completeness of Kozen’s Axiomatisation of the Propositional μ-Calculus (IW), pp. 14–24.
SIGIR-1994-BruzaH #using: Investigating Aboutness Axioms using Information Fields (PB, TWCH), pp. 112–121.
ICLP-1994-DixM #approach #semantics #source code: An Axiomatic Approach to Semantics of Disjunctive Programs (JD, MM), pp. 303–320.
LICS-1994-FioreP #formal method #modelling: An Axiomatization of Computationally Adequate Domain Theoretic Models of FPC (MPF, GDP), pp. 92–102.
LICS-1994-Meyden #distributed: Axioms for Knowledge and Time in Distributed Systems with Perfect Recall (RvdM), pp. 448–457.
LICS-1994-Sewell #bisimulation #equation #first-order: Bisimulation is Not Finitely (First Order) Equationally Axiomatisable (PS), pp. 62–70.
KR-1992-Davis92a #process: Axiomatizing Qualitative Process Theory (ED), pp. 177–188.
ALP-1992-LaneveM #equivalence #permutation #λ-calculus: Axiomatizing Permutation Equivalence in the λ-Calculus (CL, UM), pp. 350–363.
WSA-1992-Jensen #data type #recursion: Axiomatising Uniform Properties of Recursive Data Structures (TPJ), pp. 144–151.
LICS-1992-Seth #recursion: There is No Recursive Axiomatization for Feasible Functionals of Type~2 (AS), pp. 286–295.
LICS-1992-Stolboushkin #finite #linear #modelling #order: Axiomatizable Classes of Finite Models and Definability of Linear Order (APS), pp. 64–70.
ICALP-1991-Comon #algebra: Complete Axiomatizations of Some Quotient Term Algebras (HC), pp. 469–480.
ML-1991-QianI #concept #consistency: The Consistent Concept Axiom (ZQ, KBI), pp. 437–441.
WSA-1991-Billaud #backtracking: Axiomatizations of Backtracking (MB), pp. 111–116.
ICLP-1991-ColussiM #correctness #logic programming #proving #semantics #source code #using: Proving Correctness of Logic Programs Using Axiomatic Semantics (LC, EM), pp. 629–642.
ICLP-1991-Decker #on the: On Generalized Cover Axioms (HD), pp. 693–707.
LFP-1990-HowardM #semantics: Operational and Axiomatic Semantics of PCF (BTH, JCM), pp. 298–306.
ALP-1990-BronsardR #functional #logic: Axiomatization of a Functional Logic Language (FB, USR), pp. 101–116.
CADE-1990-OzturkH #similarity: Hyper Resolution and Equality Axioms without Function Substitutions (YO, LJH), pp. 456–469.
LICS-1990-Moller #finite: The Nonexistence of Finite Axiomatisations for CCS Congruences (FM), pp. 142–153.
CAAP-1989-MiglioliMO #data type: Semi-Constructive Formal Systems and Axiomatization of Abstract Data Types (PM, UM, MO), pp. 337–351.
LICS-1989-DeganoMM #process: Axiomatizing Net Computations and Processes (PD, JM, UM), pp. 175–185.
LICS-1989-MasonT #equivalence: Axiomatizing Operational Equivalence in the Presence of Side Effects (IAM, CLT), pp. 284–293.
PODS-1988-KiferRS #approach #database #deduction #query #safety: An Axiomatic Approach to Deciding Query Safety in Deductive Databases (MK, RR, AS), pp. 52–60.
CADE-1988-Pfenning #calculus: Single Axioms in the Implicational Propositional Calculus (FP), pp. 710–713.
LICS-1988-Maher #algebra #finite #infinity: Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees (MJM), pp. 348–357.
PODS-1987-KarabegKPV #relational #transaction: Axiomatization and Simplification Rules for Relational Transactions (AK, DK, KP, VV), pp. 254–259.
VLDB-1987-SiebesK #database #design #semantics #using: Using Design Axioms and Topology to Model Database Semantics (AS, MLK), pp. 51–59.
POPL-1987-HerlihyW #concurrent: Axioms for Concurrent Objects (MH, JMW), pp. 13–26.
LICS-1986-GermanCH: True Relative Completeness of an Axiom System for the Language L4 (Abridged) (SMG, EMC, JYH), pp. 11–25.
LICS-1986-Gunter: The Largest First-Order-Axiomatizable Cartesian Closed Category of Domains (CAG), pp. 142–148.
SLP-1986-HoddinottE86 #named #prolog #similarity: PROLOG: Subsumption of Equality Axioms by the Homogeneous Form (PH, EWE), pp. 115–126.
PODS-1984-GrahamV #complexity #consistency #database #on the: On the Complexity and Axiomatizability of Consistent Database States (MHG, MYV), pp. 281–289.
ICALP-1984-IzumiIH #algebra #regular expression: A Complete Axiom System for Algebra of Closed-Regular Expression (HI, YI, NH), pp. 260–269.
SIGIR-1984-Bollmann #evaluation #information retrieval #metric: Two Axioms for Evaluation Measures in Information Retrieval (PB), pp. 233–245.
POPL-1984-Halpern #algol #hoare: A Good Hoare Axiom System for an Algol-like Language (JYH), pp. 262–271.
ICSE-1984-Gerhart #specification: Application of Axiomatic Methods to a Specification Analyser (SLG), pp. 441–453.
ICALP-1983-AptD #logic #using: An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (KRA, CD), pp. 15–27.
ICALP-1982-Gerth #ada #hoare: A Sound and Complete Hoare Axiomatization of the Ada-Rendevous (RG), pp. 252–264.
POPL-1982-ClarkeGH #effectiveness #hoare #logic #on the: On Effective Axiomatizations of Hoare Logics (EMC, SMG, JYH), pp. 309–321.
POPL-1982-MeyerM #recursion #source code: Axiomatic Definability and Completeness for Recursive Programs (ARM, JCM), pp. 337–346.
POPL-1982-Yemeni #exception: An Axiomatic Treatment of Exception Handling (SY), pp. 281–288.
ICALP-1981-Courcelle #algorithm #approach: An Axiomatic Approach to the Korenjak-Hopcroft Algorithms (BC), pp. 393–407.
POPL-1981-HalpernM #programming language: Axiomatic Definitions of Programming Languages, II (JYH, ARM), pp. 139–148.
ICALP-1980-Majster-Cederbaum #algebra #fixpoint #named #semantics: Semantics: Algebras, Fixed Points, Axioms (MEMC), pp. 394–408.
LISP-1980-Cartwright #data type: A Constructive Alternative to Axiomatic Data Type Definitions (RC), pp. 46–55.
POPL-1980-MeyerH #assessment #programming language: Axiomatic Definitions of Programming Languages: A Theoretical Assessment (ARM, JYH), pp. 203–212.
STOC-1980-Mirkowska #algorithm #bound #nondeterminism: Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondeterministic Interpretations (GM), pp. 14–21.
STOC-1980-SadriU #database #dependence #relational #scalability: A Complete Axiomatization for a Large Class of Dependencies in Relational Databases (FS, JDU), pp. 117–122.
ICALP-1979-Jeanrond #commutative #termination #theorem: A Unique Termination Theorem for a Theory with Generalised Commutative Axioms (HJJ), pp. 316–330.
ICALP-1979-Schwartz #algol: An Axiomatic Treatment of Algol 68 Routines (RLS), pp. 530–545.
POPL-1979-ReitmanA #approach #data flow #source code: Certifying Information Flow Properties of Programs: An Axiomatic Approach (RPR, GRA), pp. 283–290.
STOC-1979-Berman #semantics: A Completeness Technique for D-Axiomatizable Semantics (FB), pp. 160–166.
VLDB-1978-Kalinichenko #modelling: Data Models Transformation Method Based on Axiomatic Data Model Extension (LAK), pp. 549–555.
SIGMOD-1977-BeeriFH #database #dependence #functional #multi: A Complete Axiomatization for Functional and Multivalued Dependencies in Database Relations (CB, RF, JHH), pp. 47–61.
POPL-1977-Clarke #hoare #programming language: Programming Language Constructs for Which it is Impossible to Obtain “Good” Hoare-Like Axiom Systems (EMC), pp. 10–20.
STOC-1977-HarelPS #deduction #proving #recursion #source code: A Complete Axiomatic System for Proving Deductions about Recursive Programs (DH, AP, JS), pp. 249–260.
SOSP-J-1975-OwickiG76 #approach #parallel #source code #verification: Verifying Properties of Parallel Programs: An Axiomatic Approach (SSO, DG), pp. 279–285.
ICALP-1974-Roever #approach #parametricity #recursion: Recursion and Parameter Mechanisms: An Axiomatic Approach (WPdR), pp. 34–65.
STOC-1974-CourcelleV #recursion #semantics: Semantics and Axiomatics of a Simple Recursive Language (BC, JV), pp. 13–26.