Tag #logic
3011 papers:
POPL-2020-AschieriG #concurrent #functional #linear #parallel #proving #source code- Par means parallel: multiplicative linear logic proofs as concurrent functional programs (FA, FAG), p. 28.
POPL-2020-BartheHL #probability- A probabilistic separation logic (GB, JH, KL), p. 30.
POPL-2020-HinrichsenBK #named #reasoning- Actris: session-type based reasoning in separation logic (JKH, JB, RK), p. 30.
POPL-2020-JungLPRTDJ - The future is ours: prophecy variables in separation logic (RJ0, RL, GP, MR, AT, DD, BJ0), p. 32.
POPL-2020-MaillardHRM #relational- The next 700 relational program logics (KM, CH, ER, AVM), p. 33.
POPL-2020-OHearn - Incorrectness logic (PWO), p. 32.
ASPLOS-2020-TzimpragosVTMMV - A Computational Temporal Logic for Superconducting Accelerators (GT, DV, NT, GM, AM, JV, JS, TS), pp. 435–448.
CSL-2020-AcclavioM #linear #multi- Generalized Connectives for Multiplicative Linear Logic (MA, RM), p. 16.
CSL-2020-DemriLM #calculus- Internal Calculi for Separation Logics (SD, ÉL, AM), p. 18.
CSL-2020-GrangeS #first-order #invariant- Order-Invariant First-Order Logic over Hollow Trees (JG, LS), p. 16.
CSL-2020-HoelzelW #higher-order #on the #semantics- On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics (MH, RW), p. 16.
CSL-2020-KupkeR #induction- Expressive Logics for Coinductive Predicates (CK, JR), p. 18.
CSL-2020-LyonTGC - Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents (TL, AT, RG, RC), p. 16.
EDM-2019-BanjadeR #probability #student #tutorial #using- Assessing Student Response in Tutorial Dialogue Context using Probabilistic Soft Logic (RB, VR).
SANER-2019-WangCLSL #fuzzing- Fuzzing Program Logic Deeply Hidden in Binary Program Stages (YW, ZLC, YL, PS, ZL), pp. 105–116.
DLT-2019-GastinMG #regular expression- Logics for Reversible Regular Languages and Semigroups with Involution (PG, AM, RG), pp. 182–191.
FM-2019-ArusoaieL #unification- Unification in Matching Logic (AA, DL), pp. 502–518.
FM-2019-LunelMBT #composition #difference #parallel #verification- Parallel Composition and Modular Verification of Computer Controlled Systems in Differential Dynamic Logic (SL, SM, BB, JPT), pp. 354–370.
FSCD-2019-Diaz-CaroD #identification #normalisation #proving- Proof Normalisation in a Logic Identifying Isomorphic Propositions (ADC, GD), p. 23.
FSCD-2019-Felty #framework #hybrid #linear- A Linear Logical Framework in Hybrid (Invited Talk) (APF), p. 2.
FSCD-2019-FukudaY #re-engineering- A Linear-Logical Reconstruction of Intuitionistic Modal Logic S4 (YF0, AY), p. 24.
FSCD-2019-HeijltjesHS #first-order #linear #proving- Proof Nets for First-Order Additive Linear Logic (WH, DJDH, LS), p. 22.
FSCD-2019-Horne #linear #probability #proving- The Sub-Additives: A Proof Theory for Probabilistic Choice extending Linear Logic (RH), p. 16.
- IFM-2019-BubelHT #analysis #dependence
- A Program Logic for Dependence Analysis (RB, RH, AHT), pp. 83–100.
SEFM-2019-Kawamoto #machine learning #specification #statistics #towards- Towards Logical Specification of Statistical Machine Learning (YK0), pp. 293–311.
- ICFP-2019-ZhangRHP0 #difference #named #privacy
- Fuzzi: a three-level logic for differential privacy (HZ, ER, AH, BCP, AR0), p. 28.
CoG-2019-HufkensB #functional #taxonomy- A Functional Taxonomy of Logic Puzzles (LVH, CB), pp. 1–4.
CoG-2019-PiettePSSB #game studies- Ludii and XCSP: Playing and Solving Logic Puzzles (CP, ÉP, MS, DJNJS, CB), pp. 1–4.
CoG-2019-Ramon #game studies- Logic foundations of manipulation as game mechanics (JMTR), pp. 1–4.
ICML-2019-BansalLRSW #higher-order #machine learning #named #proving #theorem proving- HOList: An Environment for Machine Learning of Higher Order Logic Theorem Proving (KB, SML, MNR, CS, SW), pp. 454–463.
ICML-2019-FischerBDGZV #named #network #query- DL2: Training and Querying Neural Networks with Logic (MF, MB, DDC, TG, CZ, MTV), pp. 1931–1941.
ICML-2019-JiangL #learning- Neural Logic Reinforcement Learning (ZJ, SL), pp. 3110–3119.
ICML-2019-WangDWK #learning #named #reasoning #satisfiability #using- SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver (PWW, PLD, BW, JZK), pp. 6545–6554.
ECOOP-2019-WattMKG #encapsulation #first-order- A Program Logic for First-Order Encapsulated WebAssembly (CW, PM, NRK, PG), p. 30.
OOPSLA-2019-Nanevski0DF #concurrent #morphism #simulation #source code #specification- Specifying concurrent programs in separation logic: morphisms and simulations (AN, AB0, GAD, IF), p. 30.
OOPSLA-2019-SongLO #automation #detection #fault #functional #programming #scalability- Automatic and scalable detection of logical errors in functional programming assignments (DS, ML, HO), p. 30.
OOPSLA-2019-Ter-GabrielyanS #composition #reachability #verification- Modular verification of heap reachability properties in separation logic (ATG, AJS, PM0), p. 28.
PLDI-2019-LeZN #dynamic analysis #invariant #named #using- SLING: using dynamic analysis to infer program invariants in separation logic (TCL, GZ, TN), pp. 788–801.
PLDI-2019-ZhouYY #hoare #quantum- An applied quantum Hoare logic (LZ, NY, MY), pp. 1149–1162.
POPL-2019-BaeL #bound #model checking #using- Bounded model checking of signal temporal logic properties using syntactic separation (KB, JL), p. 30.
POPL-2019-BatzKKMN #pointer #probability #reasoning #source code- Quantitative separation logic: a logic for reasoning about probabilistic pointer programs (KB, BLK, JPK, CM, TN0), p. 29.
POPL-2019-BizjakGKB #concurrent #higher-order #named- Iron: managing obligations in higher-order concurrent separation logic (AB, DG, RK, LB), p. 30.
POPL-2019-TassarottiH #concurrent #random #source code- A separation logic for concurrent randomized programs (JT, RH0), p. 30.
POPL-2019-Unruh #hoare #quantum #relational- Quantum relational Hoare logic (DU), p. 31.
PPDP-2019-Bakel #exception- Exception Handling and Classical Logic (SvB), p. 14.
SAS-2019-0001NIU #first-order #fixpoint #source code #verification- Temporal Verification of Programs via First-Order Fixpoint Logic (NK0, TN, AI, HU0), pp. 413–436.
SAS-2019-OkuyamaT0 #functional #higher-order #source code- A Temporal Logic for Higher-Order Functional Programs (YO, TT, NK0), pp. 437–458.
CASE-2019-AhlbergD #metric #multi #synthesis- Human-in-the-Loop Control Synthesis for Multi-Agent Systems under Hard and Soft Metric Interval Temporal Logic Specifications* (SA, DVD), pp. 788–793.
CASE-2019-TheisMD #mining #process #programmable- Process Mining of Programmable Logic Controllers: Input/Output Event Logs (JT, IM, HD), pp. 216–221.
FASE-2019-GieseMSS #graph #metric- Metric Temporal Graph Logic over Typed Attributed Graphs (HG, MM, LS, SS0), pp. 282–298.
FASE-2019-HennickerMK #data-driven #hybrid- A Hybrid Dynamic Logic for Event/Data-Based Systems (RH, AM, AK), pp. 79–97.
CADE-2019-BarbosaROTB #higher-order #smt- Extending SMT Solvers to Higher-Order Logic (HB, AR, DEO, CT, CWB), pp. 35–54.
CADE-2019-BohrerFP #difference #named- dLι: Definite Descriptions in Differential Dynamic Logic (BB, MF, AP), pp. 94–110.
CADE-2019-CassanoFHAC #calculus- A Tableaux Calculus for Default Intuitionistic Logic (VC, RF, GH, CA, PFC), pp. 161–177.
CADE-2019-GutierrezL #automation #generative #modelling- Automatic Generation of Logical Models with AGES (RG, SL), pp. 287–299.
CADE-2019-SutcliffeP #named- JGXYZ: An ATP System for Gap and Glut Logics (GS, FJP), pp. 526–537.
CADE-2019-ZhaoS #automation #strict- FAME(Q): An Automated Tool for Forgetting in Description Logics with Qualified Number Restrictions (YZ, RAS), pp. 568–579.
CAV-2019-Finkbeiner0PS #synthesis- Temporal Stream Logic: Synthesis Beyond the Bools (BF, FK0, RP, MS), pp. 609–629.
CAV-2019-BerkovitsLLPS #algorithm #composition #decidability #distributed #verification- Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics (IB, ML, GL, OP, SS), pp. 245–266.
CAV-2019-ErnstM #concurrent #named #security- SecCSL: Security Concurrent Separation Logic (GE, TM), pp. 208–230.
CAV-2019-LiuZWYLLYZ #algorithm #hoare #quantum #using #verification- Formal Verification of Quantum Algorithms Using Quantum Hoare Logic (JL, BZ, SW, SY, TL, YL, MY, NZ), pp. 187–207.
VMCAI-2019-QiuW #decidability #metric- A Decidable Logic for Tree Data-Structures with Measurements (XQ, YW), pp. 318–341.
DLT-2018-FiliotMR #automaton- A Pattern Logic for Automata with Outputs (EF, NM, JFR), pp. 304–317.
DLT-2018-Michielini #finite #first-order #problem #word- Uniformization Problem for Variants of First Order Logic over Finite Words (VM), pp. 516–528.
FM-2018-BusardP - Producing Explanations for Rich Logics (SB, CP), pp. 129–146.
FSCD-2018-BellinH #linear #proving- Proof Nets for Bi-Intuitionistic Linear Logic (GB, WH), p. 18.
- IFM-2018-NguyenT #automaton #branch
- Branching Temporal Logic of Calls and Returns for Pushdown Systems (HVN, TT), pp. 326–345.
- ICFP-2018-KrebbersJ0TKTCD #framework #interactive #named #proving
- MoSeL: a general, extensible modal framework for interactive proofs in separation logic (RK, JHJ, RJ0, JT, JOK, AT, AC, DD), p. 30.
OOPSLA-2018-LeeSSO #automation #fault #functional #programming- Automatic diagnosis and correction of logical errors for functional programming assignments (JL, DS, SS, HO), p. 30.
LOPSTR-2018-FalaschiO #constraints #slicing- An Assertion Language for Slicing Constraint Logic Languages (MF, CO), pp. 148–165.
LOPSTR-2018-PapapanagiotouF #approach #composition #linear #process #scalability #using- A Pragmatic, Scalable Approach to Correct-by-Construction Process Composition Using Classical Linear Logic Inference (PP, JDF), pp. 77–93.
PADL-2018-AnandCN #automation #consistency #detection #nondeterminism #using- An Automated Detection of Inconsistencies in SBVR-based Business Rules Using Many-sorted Logic (KA, PKC, RN), pp. 80–96.
POPL-2018-PadonHLPSS #first-order #liveness #safety- Reducing liveness to safety in first-order logic (OP, JH, GL, AP, MS, SS), p. 33.
POPL-2018-TaLKC #automation #synthesis- Automated lemma synthesis in symbolic-heap separation logic (QTT, TCL, SCK, WNC), p. 29.
POPL-2018-TimanySKB #encapsulation #monad #proving- A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST (AT, LS, MKJ, LB), p. 28.
SAS-2018-Shoham #decidability #distributed #interactive #protocol #using #verification- Interactive Verification of Distributed Protocols Using Decidable Logic (SS), pp. 77–85.
ESEC-FSE-2018-ErataGKT #automation #first-order #named #reasoning #relational- AlloyInEcore: embedding of first-order relational logic into meta-object facility for automated model reasoning (FE, AG, IK, BT), pp. 920–923.
SLE-2018-HarkesCV #case study #domain-specific language #incremental #migration- Migrating business logic to an incremental computing DSL: a case study (DCH, EvC, EV), pp. 83–96.
CASE-2018-LorenzS - Online-Monitoring Autonomous Transport Robots with an R-valued Temporal Logic (FL, HS), pp. 1093–1098.
CGO-2018-0001LQDL #android #detection #distributed #using- Resilient decentralized Android application repackaging detection using logic bombs (QZ0, LL, ZQ, XD, ZL), pp. 50–61.
ESOP-2018-BartheEGGHS #probability #source code- An Assertion-Based Program Logic for Probabilistic Programs (GB, TE, MG, BG, JH, PYS), pp. 117–144.
ESOP-2018-LeH #reasoning- Logical Reasoning for Disjoint Permissions (XBL, AH), pp. 385–414.
ESOP-2018-SvendsenPDLV #semantics- A Separation Logic for a Promising Semantics (KS, JPP, MD, OL, VV), pp. 357–384.
CAV-2018-Satake0 #functional #higher-order #source code- Propositional Dynamic Logic for Higher-Order Functional Programs (YS, HU0), pp. 105–123.
CSL-2018-0001R #induction #infinity #reasoning #transitive- Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (LC0, RNSR), p. 16.
CSL-2018-BaillotG #complexity #linear- Combining Linear Logic and Size Types for Implicit Complexity (PB, AG), p. 21.
CSL-2018-ChouquetA #linear #parallel #proving- An Application of Parallel Cut Elimination in Unit-Free Multiplicative Linear Logic to the Taylor Expansion of Proof Nets (JC, LVA), p. 17.
CSL-2018-DawarW #rank #symmetry- Symmetric Circuits for Rank Logic (AD, GW), p. 16.
CSL-2018-FerrarottiBV #higher-order #transitive- Expressivity Within Second-Order Transitive-Closure Logic (FF, JVdB, JV), p. 18.
CSL-2018-FijalkowMMR #bound- Quantifying Bounds in Strategy Logic (NF, BM, AM, SR), p. 23.
CSL-2018-KrebsLPS #algebra- An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation (AK, KL, PKP, HS), p. 17.
CSL-2018-Luck #canonical #complexity #modelling- Canonical Models and the Complexity of Modal Team Logic (ML), p. 23.
CSL-2018-MadhusudanMS0 #decidability #higher-order #synthesis- A Decidable Fragment of Second Order Logic With Applications to Synthesis (PM, UM, SS, MV0), p. 19.
CSL-2018-NolletST #fixpoint #linear #proving- Local Validity for Circular Proofs in Linear Logic with Fixed Points (RN, AS, CT), p. 23.
CSL-2018-Terui #higher-order- MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics (KT), p. 19.
ICST-2018-Suarez-Otero #analysis #consistency- Analysis of the Logical Consistency in Cassandra (PSO), pp. 430–431.
ICTSS-2018-LopezKBYZ #approach- Test Derivation for SDN-Enabled Switches: A Logic Circuit Based Approach (JL, NK, AB, NY, DZ), pp. 69–84.
IJCAR-2018-BentkampBCW #higher-order- Superposition for Lambda-Free Higher-Order Logic (AB, JCB, SC, UW), pp. 28–46.
IJCAR-2018-ClaessenS #encoding #equation #first-order #performance- Efficient Encodings of First-Order Horn Formulas in Equational Logic (KC, NS), pp. 388–404.
IJCAR-2018-FingerP #probability #satisfiability- Probably Half True: Probabilistic Satisfiability over Łukasiewicz Infinitely-Valued Logic (MF, SP), pp. 194–210.
IJCAR-2018-KanovichKNS #commutative #framework- A Logical Framework with Commutative and Non-commutative Subexponentials (MIK, SK, VN, AS), pp. 228–245.
IJCAR-2018-KatelaanJW #automation #modelling- A Separation Logic with Data: Small Models and Automation (JK, DJ, GW), pp. 455–471.
IJCAR-2018-NalonP #calculus- A Resolution-Based Calculus for Preferential Logics (CN, DP), pp. 498–515.
IJCAR-2018-Platzer #difference #game studies- Uniform Substitution for Differential Game Logic (AP), pp. 211–227.
IJCAR-2018-UrbaniKJDC #performance- Efficient Model Construction for Horn Logic with VLog - System Description (JU, MK, CJHJ, ID, DC), pp. 680–688.
IJCAR-2018-ZhaoS #automation #named #semantics- FAME: An Automated Tool for Semantic Forgetting in Expressive Description Logics (YZ, RAS), pp. 19–27.
VMCAI-2018-PrabawaALC #composition #data flow #verification- A Logical System for Modular Information Flow Verification (AP, MFAA, BL, WNC), pp. 430–451.
EDM-2017-DianaSK #education #identification- Teaching Informal Logical Fallacy Identification with a Cognitive Tutor (ND, JCS, KRK).
CIAA-2017-Cortier #how- Electronic Voting: How Logic Can Help (VC), p. xi-xii.
DLT-2017-LodayaS #complexity #first-order #quantifier- Two-Variable First Order Logic with Counting Quantifiers: Complexity Results (KL, AVS), pp. 260–271.
DLT-2017-Skrzypczak #complexity #decidability- Connecting Decidability and Complexity for MSO Logic (MS), pp. 75–79.
FSCD-2017-Czajka #combinator #confluence- Confluence of an Extension of Combinatory Logic by Boolean Constants (LC0), p. 16.
FSCD-2017-LicataSR #framework- A Fibrational Framework for Substructural and Modal Logics (DRL, MS, MR), p. 22.
SEFM-2017-BozzelliMMP #model checking #regular expression- An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions (LB, AM, AM, AP), pp. 104–119.
SEFM-2017-MahmudSL #analysis #embedded #requirements #semantics #specification- Specification and Semantic Analysis of Embedded Systems Requirements: From Description Logic to Temporal Logic (NM, CS, OL), pp. 332–348.
- ICFP-2017-AguirreBG0S #higher-order #relational #source code
- A relational logic for higher-order programs (AA0, GB, MG, DG0, PYS), p. 29.
FDG-2017-OsbornWM - Refining operational logics (JCO, NWF, MM), p. 10.
MoDELS-2017-Al-RefaiCG #approach #fuzzy #modelling #testing- A Fuzzy Logic Based Approach for Model-Based Regression Test Selection (MAR, WC, SG), pp. 55–62.
ECOOP-2017-KaiserDDLV #consistency #memory management #reasoning- Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris (JOK, HHD, DD, OL, VV), p. 29.
LOPSTR-2017-Fruhwirth #algorithm #constraints- Justifications in Constraint Handling Rules for Logical Retraction in Dynamic Algorithms (TWF), pp. 147–163.
LOPSTR-2017-SkeirikSM #reachability- A Constructor-Based Reachability Logic for Rewrite Theories (SS, AS, JM), pp. 201–217.
PADL-2017-MantadelisR #probability #using- Using Iterative Deepening for Probabilistic Logic Inference (TM, RR0), pp. 198–213.
POPL-2017-DAntoniV #finite #higher-order #monad #sequence- Monadic second-order logic on finite sequences (LD, MV), pp. 232–245.
POPL-2017-KobayashiLB #fixpoint #higher-order #on the #recursion- On the relationship between higher-order recursion schemes and higher-order fixpoint logic (NK0, ÉL, FB), pp. 246–259.
POPL-2017-KrebbersTB #concurrent #higher-order #interactive #proving- Interactive proofs in higher-order concurrent separation logic (RK, AT, LB), pp. 205–217.
POPL-2017-Krogh-Jespersen #concurrent #higher-order #relational- A relational model of types-and-effects in higher-order concurrent separation logic (MKJ, KS, LB), pp. 218–231.
QAPL-2017-CastiglioniT #metric- Logical Characterization of Trace Metrics (VC, ST), pp. 39–74.
QAPL-2017-LidmanS #fuzzy #program analysis #using- Bridging Static and Dynamic Program Analysis using Fuzzy Logic (JL, JS), pp. 111–126.
ESEC-FSE-2017-GuoWW #execution #programmable #symbolic computation- Symbolic execution of programmable logic controller code (SG, MW, CW0), pp. 326–336.
CASE-2017-DingWL #approach #feedback #matrix #network- Output feedback disturbance decoupling of boolean control networks: A logical matrix factorization approach (XD, SW, HL0), pp. 181–186.
CASE-2017-EddelandMFA #cyber-physical- Objective functions for falsification of signal temporal logic properties in cyber-physical systems (JE, SM, MF, KÅ), pp. 1326–1331.
CASE-2017-KhanFF #automation #framework #generative #safety- Virtual engineering framework for automatic generation of control logic including safety (AK, PF, MF), pp. 648–653.
CASE-2017-Luo #fuzzy #mobile- Neural-network-based fuzzy logic tracking control of mobile robots (CL), pp. 1318–1319.
CASE-2017-YangLXC #algebra #network- Controllability of dynamic-algebraic mix-valued logical control networks (LY, BL, RX, JC), pp. 171–176.
ESOP-2017-ChargueraudP - Temporary Read-Only Permissions for Separation Logic (AC, FP), pp. 260–286.
ESOP-2017-GeorgesMOP #framework #linear #named- LINCX: A Linear Logical Framework with First-Class Contexts (ALG, AM, SO, BP), pp. 530–555.
ESOP-2017-JansenKMNZ #reasoning #robust- Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic (CJ, JK, CM, TN0, FZ), pp. 611–638.
ESOP-2017-Krebbers0BJDB #concurrent #higher-order- The Essence of Higher-Order Concurrent Separation Logic (RK, RJ0, AB, JHJ, DD, LB), pp. 696–723.
ESOP-2017-TassarottiJ0 #concurrent #higher-order #refinement- A Higher-Order Logic for Concurrent Termination-Preserving Refinement (JT, RJ0, RH0), pp. 909–936.
CADE-2017-BrotherstonGK #array #problem- Biabduction (and Related Problems) in Array Separation Logic (JB, NG, MIK), pp. 472–490.
CADE-2017-HustadtOD #metric #proving #theorem proving- Theorem Proving for Metric Temporal Logic over the Naturals (UH, AO, CD), pp. 326–343.
CADE-2017-Kiesl0 #first-order- A Unifying Principle for Clause Elimination in First-Order Logic (BK, MS0), pp. 274–290.
CADE-2017-XuCW #composition #constraints #satisfiability- Satisfiability of Compositional Separation Logic with Tree Predicates and Data Constraints (ZX, TC, ZW), pp. 509–527.
CAV-2017-Vafeiadis #consistency #memory management #using #verification- Program Verification Under Weak Memory Consistency Using Separation Logic (VV), pp. 30–46.
CAV-2017-Vazquez-Chanlatte #clustering #learning- Logical Clustering and Learning for Time-Series Data (MVC, JVD, XJ, SAS), pp. 305–325.
CAV-2017-LeT0C #decidability #induction- A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic (QLL, MT, JS0, WNC), pp. 495–517.
CSL-2017-BednarczykCK - Extending Two-Variable Logic on Trees (BB, WC, EK), p. 20.
CSL-2017-Boudou #decidability- Decidable Logics with Associative Binary Modalities (JB), p. 15.
CSL-2017-BoudouDF #decidability- A Decidable Intuitionistic Temporal Logic (JB, MD, DFD), p. 17.
CSL-2017-BresolinMS #performance #reasoning- Fast(er) Reasoning in Interval Temporal Logic (DB, EMV, GS), p. 17.
CSL-2017-ChenFH #bound #first-order #quantifier #rank #slicing- Slicewise Definability in First-Order Logic with Bounded Quantifier Rank (YC, JF, XH), p. 16.
CSL-2017-Hannula #dependence- Validity and Entailment in Modal and Propositional Dependence Logics (MH), p. 17.
CSL-2017-Luck #power of #semantics- The Power of the Filtration Technique for Modal Logics with Team Semantics (ML), p. 20.
VMCAI-2017-DSilvaS #abstraction #subclass- Complete Abstractions and Subclassical Modal Logics (VD, MS), pp. 169–186.
VMCAI-2017-ReynoldsIS #reasoning- Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic (AR, RI, CS), pp. 462–482.
EDM-2016-MostafaviB #data-driven #problem #student- Exploring the Impact of Data-driven Tutoring Methods on Students' Demonstrative Knowledge in Logic Problem Solving (BM, TB), pp. 460–465.
CIAA-2016-KapoutsisM - A Logical Characterization of Small 2NFAs (CAK, LM), pp. 163–175.
DLT-2016-Duck #automaton #graph #infinity- Weighted Automata and Logics on Infinite Graphs (SD), pp. 151–163.
FM-2016-KhyzhaGP #proving- A Generic Logic for Proving Linearizability (AK, AG, MJP), pp. 426–443.
FM-2016-TaLKC #automation #induction #proving- Automated Mutual Explicit Induction Proof in Separation Logic (QTT, TCL, SCK, WNC), pp. 659–676.
FM-2016-VakiliD #finite #similarity #using- Finite Model Finding Using the Logic of Equality with Uninterpreted Functions (AV, NAD), pp. 677–693.
FSCD-2016-ArieliA #consistency #nondeterminism #reasoning- Minimal Paradefinite Logics for Reasoning with Incompleteness and Inconsistency (OA, AA), p. 15.
FSCD-2016-BenkeSC #first-order #functional #source code #synthesis- Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic (MB, AS, DWC), p. 16.
FSCD-2016-ChaudhuriMS #composition #proving- Modular Focused Proof Systems for Intuitionistic Modal Logics (KC, SM, LS), p. 18.
- IFM-2016-Preoteasa #invariant #pointer #programming #source code #using #verification
- Verifying Pointer Programs Using Separation Logic and Invariant Based Programming in Isabelle (VP), pp. 457–473.
SEFM-2016-Cerone #analysis #framework #interactive- A Cognitive Framework Based on Rewriting Logic for the Analysis of Interactive Systems (AC), pp. 287–303.
BX-2016-SemerathDHV #co-evolution #modelling #satisfiability #synthesis #using- Change Propagation of View Models by Logic Synthesis using SAT solvers (OS, CD, ÁH0, DV), pp. 40–44.
MoDELS-2016-DaniaC #constraints #first-order #named #ocl #satisfiability- OCL2MSFOL: a mapping to many-sorted first-order logic for efficiently checking the satisfiability of OCL constraints (CD, MC), pp. 65–75.
MoDELS-2016-SemerathDHV #co-evolution #incremental #modelling- Incremental backward change propagation of view models by logic solvers (OS, CD, ÁH, DV), pp. 306–316.
LOPSTR-2016-ZielenkiewiczS #approach #automaton- Automata Theory Approach to Predicate Intuitionistic Logic (MZ, AS), pp. 345–360.
PLDI-2016-SousaD #hoare #verification- Cartesian hoare logic for verifying k-safety properties (MS, ID), pp. 57–69.
POPL-2016-BrotherstonGKR #induction #model checking- Model checking for symbolic-heap separation logic with inductive predicates (JB, NG, MIK, RR), pp. 84–96.
POPL-2016-LiangF #concurrent #scheduling- A program logic for concurrent objects under fair scheduling (HL, XF), pp. 385–399.
POPL-2016-LinB #equation #string #towards #transducer #word- String solving with word equations and transducers: towards a logic for analysing mutation XSS (AWL, PB), pp. 123–136.
PPDP-2016-GreweERM #compilation #first-order #specification- Exploration of language specifications by compilation to first-order logic (SG, SE, MR, MM), pp. 104–117.
QAPL-2016-CastiglioniGT #bisimulation #metric- Logical Characterization of Bisimulation Metrics (VC, DG, ST), pp. 44–62.
CASE-2016-AlvesBPT #approach- Planning on Discrete Events Systems: A logical approach (LVRA, HJB, PNP, RHCT), pp. 1055–1060.
ESOP-2016-Ehrhard #call-by #linear #perspective- Call-By-Push-Value from a Linear Logic Point of View (TE), pp. 202–228.
ESOP-2016-Lochbihler #encryption #higher-order #probability- Probabilistic Functions and Cryptographic Oracles in Higher Order Logic (AL), pp. 503–531.
ESOP-2016-SvendsenSB - Transfinite Step-Indexing: Decoupling Concrete and Logical Steps (KS, FS, LB), pp. 727–751.
FASE-2016-SemerathVV #generative #incremental- Iterative and Incremental Model Generation by Logic Solvers (OS, AV0, DV), pp. 87–103.
CAV-2016-WangTLYJ #analysis #automaton #representation #string- String Analysis via Automata Manipulation with Logic Circuit Representation (HEW, TLT, CHL, FY, JHRJ), pp. 241–260.
CAV-2016-DacaHK #array- Array Folds Logic (PD, TAH, AK), pp. 230–248.
CAV-2016-SickertEJK #automaton #linear- Limit-Deterministic Büchi Automata for Linear Temporal Logic (SS, JE, SJ, JK), pp. 312–332.
CSL-2016-BaeldeLS #calculus #finite- A Sequent Calculus for a Modal Logic on Finite Data Trees (DB, SL, SS), p. 16.
CSL-2016-BaillotD #linear- Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic (PB, AD0), p. 18.
CSL-2016-BanaO #semantics- Semantics for “Enough-Certainty” and Fitting's Embedding of Classical Logic in S4 (GB, MO), p. 18.
CSL-2016-Carvalho #exponential #injection #linear #multi #relational- The Relational Model Is Injective for Multiplicative Exponential Linear Logic (DdC), p. 19.
CSL-2016-Ciabattoni #calculus #theory and practice- Analytic Calculi for Non-Classical Logics: Theory and Applications (AC), p. 1.
CSL-2016-EickmeyerK #first-order #graph #invariant- Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs (KE, KiK), p. 15.
CSL-2016-EnqvistSV #algebra #fixpoint- Completeness for Coalgebraic Fixpoint Logic (SE, FS, YV), p. 19.
CSL-2016-HellaK #constraints #dependence- Dependence Logic vs. Constraint Satisfaction (LH, PGK), p. 17.
CSL-2016-KarandikarS #complexity- The Height of Piecewise-Testable Languages with Applications in Logical Complexity (PK, PS), p. 22.
CSL-2016-Kieronski #word- One-Dimensional Logic over Words (EK), p. 15.
CSL-2016-KolodziejczykMP #automaton #decidability #theorem- The Logical Strength of Büchi's Decidability Theorem (LAK, HM, PP, MS), p. 16.
CSL-2016-Luck #axiom- Axiomatizations for Propositional and Modal Team Logic (ML), p. 18.
CSL-2016-ParysT #modelling #λ-calculus- Models of Lambda-Calculus and the Weak MSO Logic (PP, ST), p. 12.
CSL-2016-TabuadaN #linear #robust- Robust Linear Temporal Logic (PT, DN), p. 21.
IJCAR-2016-Avron #framework #set- A Logical Framework for Developing and Mechanizing Set Theories (AA), pp. 3–8.
IJCAR-2016-Boudou #complexity #composition #parallel- Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition (JB), pp. 373–388.
IJCAR-2016-BozzelliMMPS #model checking- Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments (LB, AM, AM, AP, PS), pp. 389–405.
IJCAR-2016-CostaM - A Tableau System for Quasi-Hybrid Logic (DC, MAM), pp. 435–451.
IJCAR-2016-DawsonBG #calculus #theorem #using- Machine-Checked Interpolation Theorems for Substructural Logics Using Display Calculi (JED, JB, RG), pp. 452–468.
IJCAR-2016-DochertyP #graph- Intuitionistic Layered Graph Logic (SD, DJP), pp. 469–486.
IJCAR-2016-GuCW #composition #constraints- A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints (XG, TC, ZW), pp. 532–549.
IJCAR-2016-Platzer #cyber-physical #proving- Logic & Proofs for Cyber-Physical Systems (AP), pp. 15–21.
VMCAI-2016-DokoV #memory management- A Program Logic for C11 Memory Fences (MD, VV), pp. 413–430.
HT-2015-BlountMW #social #using #web- An Investigation into the Use of Logical and Rhetorical Tactics within Eristic Argumentation on the Social Web (TB, DEM, MJW), pp. 195–199.
VLDB-2015-LoroGKPB - Indexing and Selecting Hierarchical Business Logic (AL, AG, DK, DP, PB), pp. 1656–1667.
VLDB-2015-ManabeT #documentation #html- Extracting Logical Hierarchical Structure of HTML Documents Based on Headings (TM, KT), pp. 1606–1617.
CIAA-2015-Bollig #automaton #concurrent #modelling- Automata and Logics for Concurrent Systems: Five Models in Five Pages (BB), pp. 3–12.
DLT-2015-Perevoshchikov - Weight Assignment Logic (VP), pp. 413–425.
ICALP-v2-2015-MichalewskiM #higher-order #monad #quantifier- Baire Category Quantifier in Monadic Second Order Logic (HM, MM), pp. 362–374.
LATA-2015-BabariD #automaton #theorem- A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic (PB, MD), pp. 703–715.
LATA-2015-BoiretHNT #constraints- Logics for Unordered Trees with Data Constraints on Siblings (AB, VH, JN, RT), pp. 175–187.
LATA-2015-BresolinMMSS #complexity #on the- On the Complexity of Fragments of the Modal Logic of Allen’s Relations over Dense Structures (DB, DDM, AM, PS, GS), pp. 511–523.
FM-2015-DangDP #parametricity #specification #synthesis- Parameter Synthesis Through Temporal Logic Specifications (TD, TD, CP), pp. 213–230.
FM-2015-SchmittU #axiom #first-order- Axiomatization of Typed First-Order Logic (PHS, MU), pp. 470–486.
HOFM-2015-ZamanskyF15a #education #formal method #information management- Exploring the Role of Logic and Formal Methods in Information Systems Education (AZ, EF), pp. 68–74.
RTA-2015-DasS #linear #term rewriting- No complete linear term rewriting system for propositional logic (AD, LS), pp. 127–142.
RTA-2015-Rosu - Matching Logic — Extended Abstract (GR), pp. 5–21.
RTA-2015-Talcott #execution #formal method #modelling- Executable Formal Models in Rewriting Logic (CLT), p. 22.
TLCA-2015-BiernackiP #type system- Logical Relations for Coherence of Effect Subtyping (DB, PP), pp. 107–122.
FDG-2015-SmithP #generative #semantics- Semantic Descriptions for Logical Content Generation (TS0, JAP).
CSCW-2015-MazmanianEH - Circumscribed Time and Porous Time: Logics as a Way of Studying Temporality (MM, IE, EH), pp. 1453–1464.
CAiSE-2015-Batoulis0BDW #modelling #process- Extracting Decision Logic from Process Models (KB, AM, EB, GD, MW), pp. 349–366.
ICEIS-v1-2015-Castanon-PugaSG #algorithm #data mining #fuzzy #mining #mobile #using- Hybrid-Intelligent Mobile Indoor Location Using Wi-Fi Signals — Location Method Using Data Mining Algorithms and Type-2 Fuzzy Logic Systems (MCP, ASC, CGP, GLS, MFP, EAT), pp. 609–615.
ICEIS-v2-2015-PereiraD #formal method #semantics #uml #using- Systematic Mapping — Formalization of UML Semantics using Temporal Logic (VP, MED), pp. 486–493.
CIKM-2015-YeL #constraints #markov #multi #network- Structural Constraints for Multipartite Entity Resolution with Markov Logic Network (TY, HWL), pp. 1691–1694.
PADL-2015-BassedaK #transaction #using- State Space Planning Using Transaction Logic (RB, MK), pp. 17–33.
PLDI-2015-TassarottiDV #memory management #verification- Verifying read-copy-update in a logic for weak memory (JT, DD, VV), pp. 110–120.
PPDP-2015-Brock-Nannestad - Computation in focused intuitionistic logic (TBN, NG, DG), pp. 43–54.
PPDP-2015-HaarPRV #algebra #concurrent- An algebraic view of space/belief and extrusion/utterance for concurrency/epistemic logic (SH, SP, CR, FDV), pp. 161–172.
ASE-2015-BocicB #performance #verification- Efficient Data Model Verification with Many-Sorted Logic (T) (IB, TB), pp. 42–52.
ICSE-v1-2015-RegisDDA #specification- Specifying Event-Based Systems with a Counting Fluent Temporal Logic (GR, RD, ND, NA), pp. 733–743.
DAC-2015-ChenH #equivalence #probability- Equivalence among stochastic logic circuits and its application (THC, JPH), p. 6.
DAC-2015-SonghoriHSK #nearest neighbour #privacy #synthesis #using- Compacting privacy-preserving k-nearest neighbor search using logic synthesis (EMS, SUH, ARS, FK), p. 6.
DAC-2015-TenaceCMP #synthesis- One-pass logic synthesis for graphene-based Pass-XNOR logic circuits (VT, AC, EM, MP), p. 6.
DAC-2015-WangH0LL #memory management #named- ProPRAM: exploiting the transparent logic resources in non-volatile memory for near data computing (YW, YH, LZ, HL, XL), p. 6.
DATE-2015-JiRML #hardware #implementation #network #probability #using- A hardware implementation of a radial basis function neural network using stochastic logic (YJ, FR, CM, DJL), pp. 880–883.
DATE-2015-SaifhashemiHBB #equivalence #tool support #using- Logical equivalence checking of asynchronous circuits using commercial tools (AS, HHH, PB, PAB), pp. 1563–1566.
DATE-2015-TemanKGMB #embedded #energy #trade-off- Energy versus data integrity trade-offs in embedded high-density logic compatible dynamic memories (AT, GK, RG, PAM, APB), pp. 489–494.
DATE-2015-VenkatesanVFRR #energy #named- Spintastic: spin-based stochastic logic for energy-efficient computing (RV, SV, XF, KR, AR), pp. 1575–1578.
DATE-2015-ZhangYWLC #design #power management- Giant spin hall effect (GSHE) logic design for low power application (YZ, BY, WW, HL, YC), pp. 1000–1005.
PDP-2015-SoaresRS #concurrent #semantics- Revisiting Concurrent Separation Logic and Operational Semantics (PS, AR, SMdS), pp. 484–491.
SOSP-2015-ChenZCCKZ #file system #hoare #using- Using Crash Hoare logic for certifying the FSCQ file system (HC, DZ, TC, AC, MFK, NZ), pp. 18–37.
ESOP-2015-RaadVG #concurrent #named- CoLoSL: Concurrent Local Subjective Logic (AR, JV, PG), pp. 710–735.
ESOP-2015-SieczkowskiSBP #consistency- A Separation Logic for Fictional Sequential Consistency (FS, KS, LB, JPP), pp. 736–761.
FoSSaCS-2015-AntonopoulosHRW #realtime- Three Variables Suffice for Real-Time Logic (TA, PH, SR, JW), pp. 361–374.
FoSSaCS-2015-BagnolDS #dependence #on the- On the Dependencies of Logical Rules (MB, AD, AS), pp. 436–450.
FoSSaCS-2015-BizjakB #probability- Step-Indexed Logical Relations for Probability (AB, LB), pp. 279–294.
FoSSaCS-2015-BozzelliMP - Unifying Hyper and Epistemic Temporal Logics (LB, BM, SP), pp. 167–182.
FoSSaCS-2015-GrelloisM #linear- An Infinitary Model of Linear Logic (CG, PAM), pp. 41–55.
FoSSaCS-2015-KlinR #algebra #semantics- Coalgebraic Trace Semantics via Forgetful Logics (BK, JR), pp. 151–166.
FoSSaCS-2015-Mamouras #hoare #nondeterminism #synthesis- Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism (KM), pp. 25–40.
FoSSaCS-2015-SchubertUZ #first-order #on the- On the Mints Hierarchy in First-Order Intuitionistic Logic (AS, PU, KZ), pp. 451–465.
FoSSaCS-2015-Vakar #category theory #framework #linear #semantics- A Categorical Semantics for Linear Logical Frameworks (MV), pp. 102–116.
CADE-2015-BalbianiB #composition #parallel- Tableaux Methods for Propositional Dynamic Logics with Separating Parallel Composition (PB, JB), pp. 539–554.
CADE-2015-EchenimPT #equation #generative #quantifier- Quantifier-Free Equational Logic and Prime Implicate Generation (ME, NP, ST), pp. 311–325.
CADE-2015-HouGT #automation #proving #theorem proving- Automated Theorem Proving for Assertions in Separation Logic with All Connectives (ZH, RG, AT), pp. 501–516.
CADE-2015-Platzer #calculus #difference- A Uniform Substitution Calculus for Differential Dynamic Logic (AP), pp. 467–481.
CSL-2015-AminiE #linear #on the- On Classical PCF, Linear Logic and the MIX Rule (SA, TE), pp. 582–596.
CSL-2015-BaazF - Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic (MB, CGF), pp. 94–109.
CSL-2015-BreuvartP #linear #modelling #relational #semantics- Modelling Coeffects in the Relational Semantics of Linear Logic (FB, MP), pp. 567–581.
CSL-2015-BrotherstonV - Sub-classical Boolean Bunched Logics and the Meaning of Par (JB, JV), pp. 325–342.
CSL-2015-CarapelleL #constraints- Temporal Logics with Local Constraints (CC, ML), pp. 2–13.
CSL-2015-Charatonik0 #linear #order- Two-variable Logic with Counting and a Linear Order (WC, PW), pp. 631–647.
CSL-2015-CranenLW #fixpoint- Evidence for Fixpoint Logic (SC, BL, TACW), pp. 78–93.
CSL-2015-GradelP #exclamation #rank- Rank Logic is Dead, Long Live Rank Logic! (EG, WP), pp. 390–404.
CSL-2015-GrelloisM #higher-order #linear #model checking #relational #semantics- Relational Semantics of Linear Logic and Higher-order Model Checking (CG, PAM), pp. 260–276.
CSL-2015-MazowieckiR #automaton #towards- Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata (FM, CR), pp. 144–159.
CSL-2015-MogaveroP #first-order- Binding Forms in First-Order Logic (FM, GP), pp. 648–665.
CSL-2015-MolinariMP #model checking- A Model Checking Procedure for Interval Temporal Logics based on Track Representatives (AM, AM, AP), pp. 193–210.
CSL-2015-Paperman #first-order- Finite-Degree Predicates and Two-Variable First-Order Logic (CP), pp. 616–630.
CSL-2015-SanoV #axiom #dependence- Axiomatizing Propositional Dependence Logics (KS, JV), pp. 292–307.
ICLP-2015-AngelopoulosG #approach #biology #database- A Logical Approach to Working with Biological Databases (NA, GG), pp. 235–246.
ICLP-2015-Hallen #data mining #higher-order #mining #specification- Higher Order Support in Logic Specification Languages for Data Mining Applications (MvdH), pp. 330–336.
ICLP-2015-LeeMW #markov #semantics- Markov Logic Style Weighted Rules under the Stable Model Semantics (JL, YM, YW), pp. 207–220.
ICLP-J-2015-AguadoCPPV #equilibrium #semantics- A denotational semantics for equilibrium logic (FA, PC, DP, GP, CV), pp. 620–634.
ICLP-J-2015-CabalarDV #encoding #equilibrium- An infinitary encoding of temporal equilibrium logic (PC, MD, CV), pp. 666–680.
ICLP-J-2015-DassevilleHJD #composition #framework #semantics- Semantics of templates in a compositional framework for building logics (ID, MvdH, GJ, MD), pp. 681–695.
ICST-2015-RaposD #execution #fuzzy #symbolic computation #testing #uml #using- Using Fuzzy Logic and Symbolic Execution to Prioritize UML-RT Test Cases (EJR, JD), pp. 1–10.
LICS-2015-BenediktCB #decidability #fixpoint- Interpolation with Decidable Fixpoint Logics (MB, BtC, MVB), pp. 378–389.
LICS-2015-BenediktCCB #bound #complexity- The Complexity of Boundedness for Guarded Logics (MB, BtC, TC, MVB), pp. 293–304.
LICS-2015-BozzelliP #complexity #equilibrium #on the- On the Complexity of Temporal Equilibrium Logic (LB, DP), pp. 645–656.
LICS-2015-CanavoiGLP #fixpoint- Defining Winning Strategies in Fixed-Point Logic (FC, EG, SL, WP), pp. 366–377.
LICS-2015-Carreiro #bisimulation #invariant- PDL Is the Bisimulation-Invariant Fragment of Weak Chain Logic (FC), pp. 341–352.
LICS-2015-EnqvistSV #algebra #bisimulation #higher-order #monad- Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras (SE, FS, YV), pp. 353–365.
LICS-2015-FigueiraL #graph #performance #query- Path Logics for Querying Graphs: Combining Expressiveness and Efficiency (DF, LL), pp. 329–340.
LICS-2015-HeijltjesH #bound #complexity #petri net #proving- Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets (WH, DJDH), pp. 80–91.
LICS-2015-KrebsV #bound #refinement- Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth (AK, OV), pp. 689–700.
LICS-2015-OHearn #category theory #facebook- From Categorical Logic to Facebook Engineering (PWO), pp. 17–20.
EDM-2014-EaglePMB #student #using- Exploration of Student's Use of Rule Application References in a Propositional Logic Tutor (ME, VP, BM, TB), pp. 249–252.
SIGITE-2014-Kawash #higher-order #sql- Formulating second-order logic conditions in SQL (JK), pp. 115–120.
DLT-2014-Weil #algebra- From Algebra to Logic: There and Back Again The Story of a Hierarchy — (PW), pp. 275–278.
ICALP-v2-2014-DrosteP #automaton #distance #theorem- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic (MD, VP), pp. 171–182.
ICALP-v2-2014-JungLGS #first-order #probability- Monodic Fragments of Probabilistic First-Order Logic (JCJ, CL, SG, LS), pp. 256–267.
LATA-2014-DrosteD #automaton #infinity #word- Weighted Automata and Logics for Infinite Nested Words (MD, SD), pp. 323–334.
LATA-2014-FinkbeinerT #linear #modelling- Counting Models of Linear-Time Temporal Logic (BF, HT), pp. 360–371.
LATA-2014-KlaudelKD #algebra #semantics- Interval Temporal Logic Semantics of Box Algebra (HK, MK, ZD), pp. 441–452.
FM-2014-GunadiT #android #case study #metric #monitoring #operating system #performance #runtime- Efficient Runtime Monitoring with Metric Temporal Logic: A Case Study in the Android Operating System (HG, AT), pp. 296–311.
FM-2014-MitschQP #hybrid #reasoning #refactoring #refinement- Refactoring, Refinement, and Reasoning — A Logical Characterization for Hybrid Systems (SM, JDQ, AP), pp. 481–496.
FM-2014-SanatiMM #decidability #guidelines #metric #using- Analyzing Clinical Practice Guidelines Using a Decidable Metric Interval-Based Temporal Logic (MYS, WM, TSEM), pp. 611–626.
RTA-TLCA-2014-Schmitz - Implicational Relevance Logic is 2-ExpTime-Complete (SS), pp. 395–409.
RTA-TLCA-2014-StefanescuCMMSR #reachability- All-Path Reachability Logic (AS, SC, RM, BMM, TFS, GR), pp. 425–440.
SEFM-2014-BianculliGK #metric #pipes and filters #using- Trace Checking of Metric Temporal Logic with Aggregating Modalities Using MapReduce (DB, CG, SK), pp. 144–158.
SEFM-2014-SznukS #education #hoare #tool support- Tool Support for Teaching Hoare Logic (TS, AS), pp. 332–346.
SEFM-2014-TatsutaC #induction #verification- Completeness of Separation Logic with Inductive Definitions for Program Verification (MT, WNC), pp. 20–34.
CIG-2014-SwiechowskiM #game studies #prolog- Prolog versus specialized logic inference engine in General Game Playing (MS, JM), pp. 1–8.
CHI-2014-VoidaDHM - Shared values/conflicting logics: working around e-government systems (AV, LD, GRH, MM), pp. 3583–3592.
CSCW-2014-PineM #problem- Institutional logics of the EMR and the problem of “perfect” but inaccurate accounts (KHP, MM), pp. 283–294.
LCT-NLE-2014-PaisT #deduction #first-order #novel #proving- Novel Didactic Proof Assistant for First-Order Logic Natural Deduction (JP, AT), pp. 441–451.
CAiSE-2014-StulpnagelOS #markov #network #risk management- IT Risk Management with Markov Logic Networks (JvS, JO, JS), pp. 301–315.
ICEIS-v1-2014-DominguezAERLE #data mining #fuzzy #mining #roadmap #using- Advances in the Decision Making for Treatments of Chronic Patients Using Fuzzy Logic and Data Mining Techniques (MD, JA, JGE, IMR, JMLS, MJE), pp. 325–330.
ICML-c1-2014-MeiZZ #first-order #modelling #robust- Robust RegBayes: Selectively Incorporating First-Order Logic Domain Knowledge into Bayesian Models (SM, JZ, JZ), pp. 253–261.
KEOD-2014-AndreasenN #embedded #knowledge base #ontology- A Case for Embedded Natural Logic for Ontological Knowledge Bases (TA, JFN), pp. 423–427.
KEOD-2014-SurynekS #big data #challenge #graph #information management #perspective #reasoning- Theoretical Challenges in Knowledge Discovery in Big Data — A Logic Reasoning and a Graph Theoretical Point of View (PS, PS), pp. 327–332.
KEOD-2014-TongphuS #standard- A Non-standard Instance Checking for the Description Logic ELH (ST, BS), pp. 67–74.
KR-2014-BaazEV - Vienna Summer of Logic (MB, TE, HV).
KR-2014-Belardinelli #satisfiability- Satisfiability of Alternating-Time Temporal Epistemic Logic Through Tableaux (FB).
KR-2014-BienvenuCOS #query- Nested Regular Path Queries in Description Logics (MB, DC, MO, MS).
KR-2014-BorgwardtDP #decidability- Decidable Gödel Description Logics without the Finitely-Valued Model Property (SB, FD, RP).
KR-2014-BotoevaKRWZ #knowledge base #query- Query Inseparability for Description Logic Knowledge Bases (EB, RK, VR, FW, MZ).
KR-2014-DoutreHP #framework- A Dynamic Logic Framework for Abstract Argumentation (SD, AH, LP).
KR-2014-GarciaLS #finite #reasoning- Finite Model Reasoning in Horn Description Logics (YAIG, CL, TS).
KR-2014-GottlobHKL #semantics- Stable Model Semantics for Guarded Existential Rules and Description Logics (GG, AH, CK, TL).
KR-2014-Gutierrez-BasultoJ0 #branch #lightweight- Lightweight Description Logics and Branching Time: A Troublesome Marriage (VGB, JCJ, TS).
KR-2014-Herzig - Belief Change Operations: A Short History of Nearly Everything, Told in Dynamic Logic of Propositional Assignments (AH).
KR-2014-HuangM - A Temporal Logic of Strategic Knowledge (XH, RvdM).
KR-2014-KonevLOW #learning #lightweight #ontology- Exact Learning of Lightweight Description Logic Ontologies (BK, CL, AO, FW).
KR-2014-KrotzschR - Nominal Schemas in Description Logics: Complexities Clarified (MK, SR).
KR-2014-Lin #first-order #formal method #linear #source code- A Formalization of Programs in First-Order Logic with a Discrete Linear Order (FL).
KR-2014-LudwigK #difference- Practical Uniform Interpolation and Forgetting for ALC TBoxes with Applications to Logical Difference (ML, BK).
KR-2014-Potyka #consistency #linear #nondeterminism #probability #source code- Linear Programs for Measuring Inconsistency in Probabilistic Logics (NP).
KR-2014-RibeiroW - Minimal Change in AGM Revision for Non-Classical Logics (MMR, RW).
KR-2014-Thimm #aspect-oriented #information management #java #library #named #representation- Tweety: A Comprehensive Collection of Java Libraries for Logical Aspects of Artificial Intelligence and Knowledge Representation (MT).
KR-2014-Zhou #first-order #revisited- First-Order Default Logic Revisited (YZ).
ECOOP-2014-PintoDG #abstraction #named- TaDA: A Logic for Time and Data Abstraction (PdRP, TDY, PG), pp. 207–231.
Onward-2014-Skene #programming language- Description Logic as Programming Language (JS), pp. 143–162.
HILT-2014-Ball #compilation #correctness #research #verification- Correctness via compilation to logic: a decade of verification at microsoft research (TB), pp. 69–70.
PLDI-2014-PekQM #c #data type #proving #using- Natural proofs for data structure manipulation in C using separation logic (EP, XQ, PM), p. 46.
POPL-2014-Benton0N - Abstract effects and proof-relevant logical relations (NB, MH, VN), pp. 619–632.
POPL-2014-HouCGT #proving- Proof search for propositional abstract separation logics via labelled sequents (ZH, RC, RG, AT), pp. 465–476.
POPL-2014-LeeP #proving- A proof system for separation logic with magic wand (WL, SP), pp. 477–490.
PPDP-2014-LucasM #declarative #proving #source code #termination- Proving Operational Termination of Declarative Programs in General Logics (SL, JM), pp. 111–122.
ASE-2014-Floridi #design- Keynote talk: the logic of information design (LF), pp. 1–2.
DAC-2014-AmaruGM #algorithm #graph #novel #optimisation #performance- Majority-Inverter Graph: A Novel Data-Structure and Algorithms for Efficient Logic Optimization (LGA, PEG, GDM), p. 6.
DAC-2014-LinWC #data mining #design #mining #named #power management #synthesis- C-Mine: Data Mining of Logic Common Cases for Low Power Synthesis of Better-Than-Worst-Case Designs (CHL, LW, DC), p. 6.
DAC-2014-RudraDNH #case study #design- Designing Stealthy Trojans with Sequential Logic: A Stream Cipher Case Study (MRR, NAD, VN, DHKH), p. 4.
DATE-2014-AdlerAABG #debugging- Facilitating timing debug by logic path correspondence (OA, EA, IA, IB, IG), pp. 1–6.
DATE-2014-BeneventiBVDB #analysis #identification- Thermal analysis and model identification techniques for a logic + WIDEIO stacked DRAM test chip (FB, AB, PV, DD, LB), pp. 1–4.
DATE-2014-BhuniaRHRYMF #towards- Toward ultralow-power computing at exteme with silicon carbide (SiC) nanoelectromechanical logic (SB, VR, TH, SR, RY, MM, PXLF), pp. 1–6.
DATE-2014-DinhYH #design- A logic integrated optimal pin-count design for digital microfluidic biochips (TAD, SY, TYH), pp. 1–6.
DATE-2014-KahngK #memory management #scheduling- Co-optimization of memory BIST grouping, test scheduling, and logic placement (ABK, IK), pp. 1–6.
DATE-2014-LinWCH - Rewiring for threshold logic circuit minimization (CCL, CYW, YCC, CYH), pp. 1–6.
DATE-2014-LiuW #configuration management #design #embedded #obfuscation- Embedded reconfigurable logic for ASIC design obfuscation against supply chain attacks (BL, BW), pp. 1–6.
DATE-2014-PerriconeHNN #3d #case study #design- Design of 3D nanomagnetic logic circuits: A full-adder case study (RP, XSH, JN, MTN), pp. 1–6.
DATE-2014-PrenatPLGJDSPN #power management- Magnetic memories: From DRAM replacement to ultra low power logic chips (GP, GdP, CL, OG, KJ, BD, RCS, ILP, JPN), p. 1.
DATE-2014-PuEMG #power management #scalability #synthesis- Logic synthesis of low-power ICs with ultra-wide voltage and frequency scaling (YP, JDE, MM, JPdG), pp. 1–2.
DATE-2014-TenaceCMP - Pass-XNOR logic: A new logic style for P-N junction based graphene circuits (VT, AC, EM, MP), pp. 1–4.
DATE-2014-YangMPOP #using- Complementary resistive switch based stateful logic operations using material implication (YY, JM, DKP, MO, SP), pp. 1–4.
DATE-2014-ZangenehJ #design #feedback #using- Sub-threshold logic circuit design using feedback equalization (MZ, AJ), pp. 1–6.
PDP-2014-KerteszMD #distributed #multi #using- Multi-job Meta-brokering in Distributed Computing Infrastructures Using Pliant Logic (AK, GM, JDD), pp. 138–145.
PPoPP-2014-DrachslerVY #concurrent- Practical concurrent binary search trees via logical ordering (DD, MTV, EY), pp. 343–356.
PPoPP-2014-IsaacsGBBSH #execution #identification #parallel- Extracting logical structure and identifying stragglers in parallel execution traces (KEI, TG, AB, PTB, MS, BH), pp. 397–398.
FoSSaCS-2014-AntonopoulosGHKO #induction #problem- Foundations for Decision Problems in Separation Logic with General Inductive Predicates (TA, NG, CH, MIK, JO), pp. 411–425.
FoSSaCS-2014-Cirstea #algebra #approach #linear- A Coalgebraic Approach to Linear-Time Logics (CC), pp. 426–440.
TACAS-2014-BozzanoCGT #component #design #detection #fault #identification #using- Formal Design of Fault Detection and Identification Components Using Temporal Epistemic Logic (MB, AC, MG, ST), pp. 326–340.
WRLA-2014-AguirreMPP #maude- Conditional Narrowing Modulo in Rewriting Logic and Maude (LA, NMO, MP, IP), pp. 80–96.
CAV-2014-CermakLMM #model checking #named #specification #verification- MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications (PC, AL, FM, AM), pp. 525–532.
CAV-2014-PaolettiYHWK - Analyzing and Synthesizing Genomic Logic Functions (NP, BY, YH, CMW, HK), pp. 343–357.
CAV-2014-PiskacWZ #automation- Automating Separation Logic with Trees and Data (RP, TW, DZ), pp. 711–728.
ICLP-J-2014-CominiTV #linear #using- Abstract Diagnosis for tccp using a Linear Temporal Logic (MC, LT, AV), pp. 787–801.
IJCAR-2014-Blanchette0T #induction- Unified Classical Logic Completeness — A Coinductive Pearl (JCB, AP, DT), pp. 46–60.
IJCAR-2014-BozzelliS #linear- Visibly Linear Temporal Logic (LB, CS), pp. 418–433.
IJCAR-2014-CerritoDG #atl #satisfiability #testing- Optimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+ (SC, AD, VG), pp. 277–291.
IJCAR-2014-CeylanP - The Bayesian Description Logic ℬℰℒ (IIC, RP), pp. 480–494.
IJCAR-2014-Cortier #how- Electronic Voting: How Logic Can Help (VC), pp. 16–25.
IJCAR-2014-EchenimPT #equation- A Rewriting Strategy to Generate Prime Implicates in Equational Logic (ME, NP, ST), pp. 137–151.
IJCAR-2014-EhlersL #approximate #finite #incremental #satisfiability- A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic (RE, ML), pp. 360–366.
IJCAR-2014-Gore #fixpoint #ltl- And-Or Tableaux for Fixpoint Logics with Converse: LTL, CTL, PDL and CPDL (RG), pp. 26–45.
IJCAR-2014-GoreTW #proving #theorem proving #using- A History-Based Theorem Prover for Intuitionistic Propositional Logic Using Global Caching: IntHistGC System Description (RG, JT, JW), pp. 262–268.
IJCAR-2014-GorinPSWW #algebra #hybrid #named- Cool — A Generic Reasoner for Coalgebraic Hybrid Logics (DG, DP, LS, FW, TW), pp. 396–402.
IJCAR-2014-HetzlLRTW #quantifier #similarity- Introducing Quantified Cuts in Logic with Equality (SH, AL, GR, JT, DW), pp. 240–254.
IJCAR-2014-JeanninP #difference #hybrid #named- dTL2: Differential Temporal Dynamic Logic with Nested Temporalities for Hybrid Systems (JBJ, AP), pp. 292–306.
IJCAR-2014-Lindblad #calculus #higher-order- A Focused Sequent Calculus for Higher-Order Logic (FL), pp. 61–75.
IJCAR-2014-NalonMD #confluence- Clausal Resolution for Modal Logics of Confluence (CN, JM, CD), pp. 322–336.
IJCAR-2014-OlivettiP #calculus #implementation #named- NESCOND: An Implementation of Nested Sequent Calculi for Conditional Logics (NO, GLP), pp. 511–518.
IJCAR-2014-Otten #first-order #named #proving- MleanCoP: A Connection Prover for First-Order Modal Logic (JO), pp. 269–276.
IJCAR-2014-PapacchiniS #generative- Terminating Minimal Model Generation Procedures for Propositional Modal Logics (FP, RAS), pp. 381–395.
IJCAR-2014-SteigmillerGL #algorithm- Coupling Tableau Algorithms for Expressive Description Logics with Completion-Based Saturation Procedures (AS, BG, TL), pp. 449–463.
IJCAR-2014-StumpST #framework #named- StarExec: A Cross-Community Infrastructure for Logic Solving (AS, GS, CT), pp. 367–373.
LICS-CSL-2014-AsarinBDDM #behaviour- Asymptotic behaviour in temporal logic (EA, MB, AD, CD, CM), p. 9.
LICS-CSL-2014-BaierKKW #complexity #decidability #linear #monitoring- Weight monitoring with linear temporal logic: complexity and decidability (CB, JK, SK, SW), p. 10.
LICS-CSL-2014-BarceloM #combinator #graph #word- Graph logics with rational relations: the role of word combinatorics (PB, PM), p. 10.
LICS-CSL-2014-BenediktCB #effectiveness- Effective interpolation and preservation in guarded logics (MB, BtC, MVB), p. 10.
LICS-CSL-2014-BlumensathCKPB #automaton #infinity- Two-way cost automata and cost logics over infinite trees (AB, TC, DK, PP, MVB), p. 9.
LICS-CSL-2014-Bollig #automaton #communication- Logic for communicating automata with parameterized topology (BB), p. 10.
LICS-CSL-2014-BolligGMZ #automaton- Logical characterization of weighted pebble walking automata (BB, PG, BM, MZ), p. 10.
LICS-CSL-2014-BovaGS #model checking #order #set- Model checking existential logic on partially ordered sets (SB, RG, SS), p. 10.
LICS-CSL-2014-BrotherstonFPG #induction #satisfiability- A decision procedure for satisfiability in separation logic with inductive predicates (JB, CF, JANP, NG), p. 10.
LICS-CSL-2014-CharatonikKM #decidability #transitive- Decidability of weak logics with deterministic transitive closure (WC, EK, FM), p. 10.
LICS-CSL-2014-DemriD - Expressive completeness of separation logic with two variables and no separating conjunction (SD, MD), p. 10.
LICS-CSL-2014-FigueiraL - Pattern logics and auxiliary relations (DF, LL), p. 10.
LICS-CSL-2014-Fisher #biology #comprehension- Understanding biology through logic (JF), p. 1.
LICS-CSL-2014-GottlobM #bound #problem- Achieving new upper bounds for the hypergraph duality problem through logic (GG, EM), p. 10.
LICS-CSL-2014-GuenotS #normalisation #symmetry- Symmetric normalisation for intuitionistic logic (NG, LS), p. 10.
LICS-CSL-2014-PlaceZ #first-order #regular expression- Separating regular languages with first-order logic (TP, MZ), p. 10.
LICS-CSL-2014-Pratt-Hartmann #equivalence- Logics with counting and equivalence (IPH), p. 10.
VMCAI-2014-FaymonvilleFP #monitoring #parametricity- Monitoring Parametric Temporal Logic (PF, BF, DP), pp. 357–375.
VMCAI-2014-Song0G #bisimulation #markov #process- Bisimulations and Logical Characterizations on Continuous-Time Markov Decision Processes (LS, LZ, JCG), pp. 98–117.
ITiCSE-2013-KyrilovN #assessment #automation #first-order #information management #representation- Automatic formative assessment of exercises on knowledge representation in first-order logic (AK, DCN), p. 343.
ICSM-2013-QianPXJZ #mining #programming- Mining Logical Clones in Software: Revealing High-Level Business and Programming Rules (WQ, XP, ZX, SJ, WZ), pp. 40–49.
DLT-J-2012-HromkovicKKS13 #automaton #nondeterminism #representation- Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ (JH, RK, RK, RS), pp. 955–978.
ICALP-v2-2013-BartheO #composition #difference #privacy #probability #relational #source code #theorem- Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs (GB, FO), pp. 49–60.
ICALP-v2-2013-BenaimBCKLMW #complexity #finite- Complexity of Two-Variable Logic on Finite Trees (SB, MB, WC, EK, RL, FM, JW), pp. 74–88.
ICALP-v2-2013-CarreiroGS #algebra- Coalgebraic Announcement Logics (FC, DG, LS), pp. 101–112.
ICALP-v2-2013-Janin #algebra #automaton- Algebras, Automata and Logic for Languages of Labeled Birooted Trees (DJ), pp. 312–323.
LATA-2013-MontanariS #regular expression- Interval Logics and ωB-Regular Languages (AM, PS), pp. 431–443.
LATA-2013-Quaas #automaton #metric #model checking- Model Checking Metric Temporal Logic over Automata with One Counter (KQ), pp. 468–479.
RTA-2013-Accattoli #linear #normalisation- Linear Logic and Strong Normalization (BA), pp. 39–54.
RTA-2013-BaeEM #infinity #model checking #using- Abstract Logical Model Checking of Infinite-State Systems Using Narrowing (KB, SE, JM), pp. 81–96.
RTA-2013-Das #linear- Rewriting with Linear Inferences in Propositional Logic (AD), pp. 158–173.
SEFM-2013-Klimek #modelling #requirements #specification #verification- From Extraction of Logical Specifications to Deduction-Based Formal Verification of Requirements Models (RK), pp. 61–75.
TLCA-2013-BentonHN #generative- Proof-Relevant Logical Relations for Name Generation (NB, MH, VN), pp. 48–60.
TLCA-2013-BerardiT #backtracking #game studies #semantics #subclass- Games with Sequential Backtracking and Complete Game Semantics for Subclassical Logics (SB, MT), pp. 61–76.
ICFP-2013-Chlipala #generative #hoare #metaprogramming #verification- The bedrock structured programming system: combining generative metaprogramming and hoare logic in an extensible program verifier (AC), pp. 391–402.
ICFP-2013-TuronDB #concurrent #higher-order #hoare #reasoning #refinement- Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency (AT, DD, LB), pp. 377–390.
CIG-2013-Browne13a #deduction- Deductive search for logic puzzles (CB), pp. 1–8.
VS-Games-2013-Pignot #design #game studies #using- Is Serious Games Design Political? The Competing Logics When Using a Game Engine (EP), pp. 1–2.
HCI-AMTE-2013-HirataY #design pattern #user interface #using- A Logical Design Method for User Interface Using GUI Design Patterns (IH, TY), pp. 361–370.
HCI-III-2013-SouiAG #adaptation #approach #design #fuzzy- Fuzzy Logic Approach for Adaptive Systems Design (MS, MA, KG), pp. 141–150.
ICEIS-v1-2013-EllouzeLB #database #design #object-oriented #realtime- Object-oriented Real-time Database Design based on Description Logics (ZE, NL, RB), pp. 264–271.
CIKM-2013-BailPS #ontology #owl- The logical diversity of explanations in OWL ontologies (SB, BP, US), pp. 559–568.
MLDM-2013-LeeBZ #fuzzy #multi #summary #topic #using- Multi-document Text Summarization Using Topic Model and Fuzzy Logic (SL, SB, YZ), pp. 159–168.
ECOOP-2013-HeuleKMS #abstraction #generative #verification- Verification Condition Generation for Permission Logics with Abstract Predicates and Abstraction Functions (SH, ITK, PM, AJS), pp. 451–476.
OOPSLA-2013-VafeiadisN #concurrent- Relaxed separation logic: a program logic for C11 concurrency (VV, CN), pp. 867–884.
LOPSTR-2013-AntoyJ #compilation #functional- Compiling a Functional Logic Language: The Fair Scheme (SA, AJ), pp. 202–219.
LOPSTR-2013-Saeedloei #encoding #π-calculus- A Logical Encoding of Timed π-Calculus (NS), pp. 164–182.
PEPM-2013-AlpuenteFV #automation #specification #using- Automatic inference of specifications using matching logic (MA, MAF, AV), pp. 127–136.
POPL-2013-JensenBK #low level- High-level separation logic for low-level code (JBJ, NB, AK), pp. 301–314.
POPL-2013-TuronTABD #concurrent #fine-grained- Logical relations for fine-grained concurrency (AJT, JT, AA, LB, DD), pp. 343–356.
POPL-2013-VytiniotisJCR #haskell #named #semantics- HALO: haskell to logic through denotational semantics (DV, SLPJ, KC, DR), pp. 431–442.
PPDP-2013-SimmonsZ #automaton #semantics- A logical correspondence between natural semantics and abstract machines (RJS, IZ), pp. 109–119.
ASE-2013-Demasi #fault tolerance #source code #specification- Synthesizing fault-tolerant programs from deontic logic specifications (RD), pp. 750–753.
ESEC-FSE-2013-DubinskyFG #question- Where is the business logic? (YD, YAF, MG), pp. 667–670.
ESEC-FSE-2013-Vardi - A logical revolution (MYV), p. 1.
DAC-2013-AmaruGM #composition #named #synthesis- BDS-MAJ: a BDD-based logic synthesis tool exploiting majority logic decomposition (LGA, PEG, GDM), p. 6.
DAC-2013-LiuCHVNBP #design #energy #physics- Minimum-energy state guided physical design for nanomagnet logic (SL, GC, XSH, EV, MTN, GHB, WP), p. 7.
DAC-2013-YuanX #fault #low cost #named #scalability- InTimeFix: a low-cost and scalable technique for in-situ timing error masking in logic circuits (FY, QX), p. 6.
DATE-2013-AmaruGM #canonical #novel #synthesis- Biconditional BDD: a novel canonical BDD for logic synthesis targeting XOR-rich circuits (LGA, PEG, GDM), pp. 1014–1017.
DATE-2013-MiryalaMCMP #configuration management- A verilog-a model for reconfigurable logic gates based on graphene pn-junctions (SM, MM, AC, EM, MP), pp. 877–880.
DATE-2013-PalitHNN #design- Systematic design of nanomagnet logic circuits (IP, XSH, JN, MTN), pp. 1795–1800.
DATE-2013-ParkQPC #embedded #self- 40.4fJ/bit/mm low-swing on-chip signaling with self-resetting logic repeaters embedded within a mesh NoC in 45nm SOI CMOS (SP, MQ, LSP, APC), pp. 1637–1642.
DATE-2013-ShafaeiSP #synthesis- Reversible logic synthesis of k-input, m-output lookup tables (AS, MS, MP), pp. 1235–1240.
DATE-2013-SuR - Defect-tolerant logic hardening for crossbar-based nanosystems (YS, WR), pp. 1801–1806.
DATE-2013-YakovlevVR #industrial #roadmap #tool support- Advances in asynchronous logic: from principles to GALS & NoC, recent industry applications, and commercial CAD tools (AY, PV, MR), pp. 1715–1724.
ESOP-2013-AlpuenteBFS #analysis #specification- Slicing-Based Trace Analysis of Rewriting Logic Specifications with iJulienne (MA, DB, FF, JS), pp. 121–124.
ESOP-2013-WickersonDP #proving- Ribbon Proofs for Separation Logic (JW, MD, MJP), pp. 189–208.
FoSSaCS-2013-Czajka #higher-order #recursion- Partiality and Recursion in Higher-Order Logic (LC0), pp. 177–192.
FoSSaCS-2013-DahlqvistP #algebra- Some Sahlqvist Completeness Results for Coalgebraic Logics (FD, DP), pp. 193–208.
FoSSaCS-2013-KrebbersW #control flow- Separation Logic for Non-local Control Flow and Block Scope Variables (RK, FW), pp. 257–272.
FoSSaCS-2013-Staton #algebra- An Algebraic Presentation of Predicate Logic — (SS), pp. 401–417.
FoSSaCS-2013-Strassburger - Cut Elimination in Nested Sequents for Intuitionistic Modal Logics (LS), pp. 209–224.
CADE-2013-BeckertB #semantics- Dynamic Logic with Trace Semantics (BB, DB), pp. 315–329.
CADE-2013-BeckertGS #algorithm- Analysing Vote Counting Algorithms via Logic — And Its Application to the CADE Election Scheme (BB, RG, CS), pp. 135–144.
CADE-2013-BenderPS - System Description: E-KRHyper 1.4 — Extensions for Unique Names and Description Logic (MB, BP, CS), pp. 126–134.
CADE-2013-ChihaniMR #first-order #proving- Foundational Proof Certificates in First-Order Logic (ZC, DM, FR), pp. 162–177.
CADE-2013-Filliatre - One Logic to Use Them All (JCF), pp. 1–20.
CADE-2013-GoreT - An Improved BDD Method for Intuitionistic Propositional Logic: BDDIntKt System Description (RG, JT), pp. 275–281.
CADE-2013-IosifRS #recursion- The Tree Width of Separation Logic with Recursive Definitions (RI, AR, JS), pp. 21–38.
CADE-2013-Mayer #hybrid #proving #transitive- A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies (MCM), pp. 76–90.
CAV-2013-HaaseIOP #graph #named #reasoning- SeLoger: A Tool for Graph-Based Reasoning in Separation Logic (CH, SI, JO, MJP), pp. 790–795.
CAV-2013-PiskacWZ #automation #smt #using- Automating Separation Logic Using SMT (RP, TW, DZ), pp. 773–789.
CAV-2013-TsaiTH #automaton #game studies- GOAL for Games, ω-Automata, and Logics (MHT, YKT, YSH), pp. 883–889.
CSL-2013-BerkholzKV #bound #quantifier- Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy (CB, AK, OV), pp. 61–80.
CSL-2013-CloustonDGT #calculus #linear- Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic (RC, JED, RG, AT), pp. 197–214.
CSL-2013-GallianiH #fixpoint- Inclusion Logic and Fixed Point Logic (PG, LH), pp. 281–295.
CSL-2013-GallianiHK #independence- Hierarchies in independence logic (PG, MH, JK), pp. 263–280.
CSL-2013-Girard - Three lightings of logic (JYG), pp. 11–23.
CSL-2013-HampsonK #first-order #linear- One-variable first-order linear temporal logics with counting (CH, AK), pp. 348–362.
CSL-2013-HarwathS #first-order #invariant #locality #on the #quantifier- On the locality of arb-invariant first-order logic with modulo counting quantifiers (FH, NS), pp. 363–379.
CSL-2013-Hunter #metric #question- When is Metric Temporal Logic Expressively Complete? (PH), pp. 380–394.
CSL-2013-Kuusisto #automaton #distributed #message passing- Modal Logic and Distributed Message Passing Automata (AK), pp. 452–468.
CSL-2013-ManuelZ #2d- Two-Variable Logic on 2-Dimensional Structures (AM, TZ), pp. 484–499.
CSL-2013-MichaliszynO #transitive- Elementary Modal Logics over Transitive Structures (JM, JO), pp. 563–577.
ICLP-J-2013-KaminskiSSV #network- Minimal intervention strategies in logical signaling networks with ASP (RK, TS, AS, SV), pp. 675–690.
ICLP-J-2013-Maher - Relative expressiveness of defeasible logics II (MJM), pp. 579–592.
ICTSS-2013-EnoiuSP #diagrams #testing #using- Using Logic Coverage to Improve Testing Function Block Diagrams (EPE, DS, PP), pp. 1–16.
LICS-2013-AndersonDH #fixpoint #linear #programming- Maximum Matching and Linear Programming in Fixed-Point Logic with Counting (MA, AD, BH), pp. 173–182.
LICS-2013-BalbianiHT - Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL (PB, AH, NT), pp. 143–152.
LICS-2013-BenerecettiMM - Substructure Temporal Logic (MB, FM, AM), pp. 368–377.
LICS-2013-CharatonikW - Two-Variable Logic with Counting and Trees (WC, PW), pp. 73–82.
LICS-2013-Colcombet #monad #set #using #word- Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory (TC), p. 123.
LICS-2013-Comon-Lundh #modelling #named #problem #security- LICS: Logic in Computer Security — Some Attacker’s Models and Related Decision Problems (HCL), p. 1.
LICS-2013-EickmeyerKK #first-order #graph #invariant #model checking- Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes (KE, KiK, SK), pp. 134–142.
LICS-2013-FioreH #algebra #equation #multi #polymorphism #semantics #syntax- Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic (MPF, MH), pp. 520–529.
LICS-2013-GoncharovS #hoare- A Relatively Complete Generic Hoare Logic for Order-Enriched Effects (SG, LS), pp. 273–282.
LICS-2013-Hales #synthesis- Arbitrary Action Model Logic and Action Model Synthesis (JH), pp. 253–262.
LICS-2013-Halpern #first-order #proving #security #using- From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic (JYH), pp. 2–3.
LICS-2013-HunterOW #metric- Expressive Completeness for Metric Temporal Logic (PH, JO, JW), pp. 349–357.
LICS-2013-Jacobs - Measurable Spaces and Their Effect Logic (BJ0), pp. 83–92.
LICS-2013-JungR #semantics- Kripke Semantics for Modal Bilattice Logic (AJ, UR), pp. 438–447.
LICS-2013-KreutzerR #higher-order #monad- Quantitative Monadic Second-Order Logic (SK, CR), pp. 113–122.
LICS-2013-Lahav - From Frame Properties to Hypersequent Rules in Modal Logics (OL), pp. 408–417.
LICS-2013-LiangM - Unifying Classical and Intuitionistic Logics for Computational Control (CL, DM), pp. 283–292.
LICS-2013-MontanariS #complexity #equivalence- Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness (AM, PS), pp. 193–202.
LICS-2013-Panangaden - Duality in Logic and Computation (PP), pp. 4–11.
LICS-2013-Pattinson - The Logic of Exact Covers: Completeness and Uniform Interpolation (DP), pp. 418–427.
LICS-2013-RosuSCM #reachability- One-Path Reachability Logic (GR, AS, SC, BMM), pp. 358–367.
SAT-2013-Beyersdorff #complexity #proving #theorem proving- The Complexity of Theorem Proving in Autoepistemic Logic (OB), pp. 365–376.
SAT-2013-MihalT #approach #constraints #programmable- A Constraint Satisfaction Approach for Programmable Logic Detailed Placement (AM, ST), pp. 208–223.
DocEng-2012-PalfrayHNTP #segmentation- Logical segmentation for article extraction in digitized old newspapers (TP, DH, SN, PT, TP), pp. 129–132.
VLDB-2012-ZengJZ #query- Adding Logical Operators to Tree Pattern Queries on Graph-Structured Data (QZ, XJ, HZ), pp. 728–739.
MSR-2012-SteffR #co-evolution #commit #estimation #fault- Co-evolution of logical couplings and commits for defect estimation (MS, BR), pp. 213–216.
CIAA-2012-DrosteP #automaton #word- Weighted Nested Word Automata and Logics over Strong Bimonoids (MD, BP), pp. 138–148.
DLT-2012-HromkovicKKS #automaton #nondeterminism #representation- Determinism vs. Nondeterminism for Two-Way Automata — Representing the Meaning of States by Logical Formulæ (JH, RK, RK, RS), pp. 24–39.
ICALP-v2-2012-KufleitnerL #word- Lattices of Logical Fragments over Words — (MK, AL), pp. 275–286.
ICALP-v2-2012-KuperbergB #infinity #on the #power of #word- On the Expressive Power of Cost Logics over Infinite Words (DK, MVB), pp. 287–298.
ICALP-v2-2012-LitakPSS #algebra- Coalgebraic Predicate Logic (TL, DP, KS, LS), pp. 299–311.
LATA-2012-KaraST #automaton #word- Feasible Automata for Two-Variable Logic with Successor on Data Words (AK, TS, TT), pp. 351–362.
LATA-2012-MeierSTV #complexity #on the- On the Parameterized Complexity of Default Logic and Autoepistemic Logic (AM, JS, MT, HV), pp. 389–400.
FM-2012-RosuS #hoare #reachability- From Hoare Logic to Matching Logic Reachability (GR, AS), pp. 387–402.
RTA-2012-Kirchner #calculus- Rho-Calculi for Computation and Logic (CK), pp. 2–4.
RTA-2012-SeveriV #combinator #set- Meaningless Sets in Infinitary Combinatory Logic (PS, FJdV), pp. 288–304.
FLOPS-2012-AntoyP #compilation #functional- Compiling a Functional Logic Language: The Basic Scheme (SA, AP), pp. 17–31.
FLOPS-2012-Bouma #persistent #realtime- Real-Time Persistent Queues and Deques with Logic Variables (GB), pp. 62–72.
FLOPS-2012-Hirai #λ-calculus- A λ Calculus for Gödel-Dummett Logic Capturing Waitfreedom (YH), pp. 151–165.
ICFP-2012-MyreenO #higher-order #ml #synthesis- Proof-producing synthesis of ML from higher-order logic (MOM, SO), pp. 115–126.
AIIDE-2012-ChenDKJWM #modelling #named #visualisation- RoleModelVis: A Visualization of Logical Story Models (SC, AD, PK, AJ, NWF, MM).
CAiSE-2012-KopkeE #semantics- Logical Invalidations of Semantic Annotations (JK, JE), pp. 144–159.
CAiSE-2012-ZawawyKMM #analysis #markov #network #using- Requirements-Driven Root Cause Analysis Using Markov Logic Networks (HZ, KK, JM, SM), pp. 350–365.
EDOC-2012-ZarghamiSES #as a service #process- Decision as a Service: Separating Decision-making from Application Process Logic (AZ, BS, MZE, MvS), pp. 103–112.
CIKM-2012-LiuQCH - Discovering logical knowledge for deep question answering (ZL, XQ, LC, XH), pp. 1920–1924.
KEOD-2012-BessmertnyEN - About Creating Intelligence Systems in Ternary Logic (IAB, SVE, AVN), pp. 161–165.
KEOD-2012-HmidaCBN #3d #using- From 9-IM Topological Operators to Qualitative Spatial Relations using 3D Selective Nef Complexes and Logic Rules for Bodies (HBH, CC, FB, CN), pp. 208–213.
KR-2012-ArenasBCRS #knowledge base- Exchanging Description Logic Knowledge Bases (MA, EB, DC, VR, ES).
KR-2012-BienvenuLW #query- Query Containment in Description Logics Reconsidered (MB, CL, FW).
KR-2012-BoothFKP - Credibility-Limited Revision Operators in Propositional Logic (RB, EF, SK, RPP).
KR-2012-BorgwardtP #fuzzy- Undecidability of Fuzzy Description Logics (SB, RP).
KR-2012-CreignouPPW - Belief Revision within Fragments of Propositional Logic (NC, OP, RP, SW).
KR-2012-DuboisPS #modelling- Stable Models in Generalized Possibilistic Logic (DD, HP, SS).
KR-2012-GrauHKKMMW #query- Acyclicity Conditions and their Application to Query Answering in Description Logics (BCG, IH, MK, CK, DM, BM, ZW).
KR-2012-KazakovKS #product line #reasoning- Practical Reasoning with Nominals in the EL Family of Description Logics (YK, MK, FS).
KR-2012-LakemeyerL - Only-Knowing Meets Nonmonotonic Modal Logic (GL, HJL).
KR-2012-LutzSW #approach #approximate- An Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL (CL, IS, FW).
KR-2012-LutzW #complexity #query- Non-Uniform Data Complexity of Query Answering in Description Logics (CL, FW).
KR-2012-PradeR #predict #similarity- Homogeneous Logical Proportions: Their Uniqueness and Their Role in Similarity-Based Prediction (HP, GR).
KR-2012-VlaeminckVBD #complexity #order #semantics- Ordered Epistemic Logic: Semantics, Complexity and Applications (HV, JV, MB, MD).
SEKE-2012-Cao #refinement- Modal ZIA, Modal Refinement Relation and Logical Characterization (ZC), pp. 525–530.
SEKE-2012-MarchettiG #framework #model transformation #using- Model Transformation for Frameworks Using Logical Planning (GAM, ESG), pp. 563–569.
SEKE-2012-ShenHTGZ #feature model #modelling #verification- Feature modeling and Verification based on Description Logics (GS, ZH, CT, QG, WZ), pp. 422–425.
SEKE-2012-XavierOC #fuzzy #learning- Evolutionary Learning and Fuzzy Logic Applied to a Load Balancer (FCX, MGdO, CLdC), pp. 256–260.
SEKE-2012-ZhaiLZLCJ #algebra #cyber-physical #verification- Verification of Cyber-Physical Systems Based on Differential-Algebraic Temporal Dynamic Logic (XZ, BL, MZ, JL, QC, SJ), pp. 231–234.
SEKE-2012-ZhuLLCZJ #continuation #difference #using #verification- HybridUML Based Verification of CPS Using Differential Dynamic Logic (MZ, BL, JL, QC, XZ, SJ), pp. 235–238.
MoDELS-2012-KuhlmannG #ocl #relational #uml- From UML and OCL to Relational Logic and Back (MK, MG), pp. 415–431.
OOPSLA-2012-RosuS #reachability #using- Checking reachability using matching logic (GR, AS), pp. 555–574.
TOOLS-EUROPE-2012-DeAntoniM #modelling #named- TimeSquare: Treat Your Models with Logical Time (JD, FM), pp. 34–41.
PADL-2012-GillN #using- Handshaking in Kansas Lava Using Patch Logic (AG, BN), pp. 212–226.
PLDI-2012-OanceaR #parallel- Logical inference techniques for loop parallelization (CEO, LR), pp. 509–520.
POPL-2012-ChughRJ #type system- Nested refinements: a logic for duck typing (RC, PMR, RJ), pp. 231–244.
POPL-2012-GardnerMS #javascript #towards- Towards a program logic for JavaScript (PG, SM, GDS), pp. 31–44.
POPL-2012-HurDNV #bisimulation- The marriage of bisimulations and Kripke logical relations (CKH, DD, GN, VV), pp. 59–72.
POPL-2012-ReddyR - Syntactic control of interference for separation logic (USR, JCR), pp. 323–336.
PPDP-2012-FilipiukNN #fixpoint- Layered fixed point logic (PF, FN, HRN), pp. 45–54.
PPDP-2012-LamC #datalog #linear #modelling- Modeling datalog fact assertion and retraction in linear logic (ESLL, IC), pp. 67–78.
ASE-2012-BiallasBK #framework #platform #programmable #verification- Arcade.PLC: a verification platform for programmable logic controllers (SB, JB, SK), pp. 338–341.
SAC-2012-MinervinidF #concept #learning #probability- Learning probabilistic Description logic concepts: under different Assumptions on missing knowledge (PM, Cd, NF), pp. 378–383.
SAC-2012-YanZM #data type #fuzzy- f-SROIQ(G): an expressive fuzzy Description Logic supporting fuzzy data type group (LY, FZ, ZMM), pp. 320–325.
DAC-2012-AadithyaR #abstraction #automation #automaton #generative #named- DAE2FSM: automatic generation of accurate discrete-time logical abstractions for continuous-time circuit dynamics (KVA, JSR), pp. 311–316.
DAC-2012-CropPC #detection #throughput #using- Regaining throughput using completion detection for error-resilient, near-threshold logic (JC, RP, PC), pp. 974–979.
DAC-2012-DinglerKNHCNPBLS - Making non-volatile nanomagnet logic non-volatile (AD, SK, MTN, XSH, GC, JN, WP, GHB, PL, VKS), pp. 476–485.
DAC-2012-LinK #comprehension #search-based #synthesis- Application of logic synthesis to the understanding and cure of genetic diseases (PCKL, SPK), pp. 734–740.
DAC-2012-LinMK #satisfiability #using- Boolean satisfiability using noise based logic (PCKL, AM, SPK), pp. 1260–1261.
DAC-2012-MorrisBZP #named #using- mLogic: ultra-low voltage non-volatile logic circuits using STT-MTJ devices (DM, DB, JG(Z, LTP), pp. 486–491.
DAC-2012-RajendranPSK #analysis #obfuscation #security- Security analysis of logic obfuscation (JR, YP, OS, RK), pp. 83–89.
DAC-2012-RoaCJ - Material implication in CMOS: a new kind of logic (ER, WHC, BJ), pp. 1258–1259.
DAC-2012-TovinakereSD #clustering #estimation- A semiempirical model for wakeup time estimation in power-gated logic clusters (VDT, OS, SD), pp. 48–55.
DAC-2012-VenkataramaniSKRR #approximate #named #synthesis- SALSA: systematic logic synthesis of approximate circuits (SV, AS, VJK, KR, AR), pp. 796–801.
DATE-2012-LiH #analysis #named #performance #reliability- RAG: An efficient reliability analysis of logic circuits on graphics processing units (ML, MSH), pp. 316–319.
DATE-2012-PatilJCLYPLCC - Weighted area technique for electromechanically enabled logic computation with cantilever-based NEMS switches (SP, MWJ, CLC, DL, ZY, WEP, DJL, SAC, TC), pp. 727–732.
DATE-2012-RajendranPSK #analysis #encryption #fault #perspective- Logic encryption: A fault analysis perspective (JR, YP, OS, RK), pp. 953–958.
DATE-2012-SekaninaS #image #multi #towards- Towards new applications of multi-function logic: Image multi-filtering (LS, VS), pp. 824–827.
DATE-2012-TangHCH #generative #multi #reduction- Multi-patch generation for multi-error logic rectification by interpolation with cofactor reduction (KFT, PKH, CNC, CYH), pp. 1567–1572.
DATE-2012-Voyiatzis #concurrent #monitoring #multi- Input vector monitoring on line concurrent BIST based on multilevel decoding logic (IV), pp. 1251–1256.
HPDC-2012-MooreK #encapsulation #framework #performance- A resiliency model for high performance infrastructure based on logical encapsulation (JJM, CK), pp. 283–294.
WRLA-J-2010-Marti-OlietPV12 #overview #topic- Rewriting logic bibliography by topic: 1990-2011 (NMO, MP, AV), pp. 782–815.
WRLA-J-2010-Meseguer12 - Twenty years of rewriting logic (JM), pp. 721–781.
WRLA-J-2010-RiescoVMC12 #debugging #declarative #specification- Declarative debugging of rewriting logic specifications (AR, AV, NMO, RC), pp. 851–897.
ESOP-2012-JensenB - Fictional Separation Logic (JBJ, LB), pp. 377–396.
ESOP-2012-PerezCPT #concurrent #linear- Linear Logical Relations for Session-Based Concurrency (JAP, LC, FP, BT), pp. 539–558.
FoSSaCS-2012-PreugschatW #automaton #effectiveness #using- Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata (SP, TW), pp. 135–149.
TACAS-2012-CairesV #concurrent #model checking #named #specification- SLMC: A Tool for Model Checking Concurrent Systems against Dynamical Spatial Logic Specifications (LC, HTV), pp. 485–491.
CSL-2012-BirkedalST #concurrent- A Concurrent Logical Relation (LB, FS, JT), pp. 107–121.
CSL-2012-DeYoungCPT #communication #linear #reduction- Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication (HD, LC, FP, BT), pp. 228–242.
CSL-2012-DudderMRU #bound #combinator- Bounded Combinatory Logic (BD, MM, JR, PU), pp. 243–258.
CSL-2012-HetzlS #first-order- Herbrand-Confluence for Cut Elimination in Classical First Order Logic (SH, LS), pp. 320–334.
CSL-2012-KaiserL - A Counting Logic for Structure Transition Systems (LK, SL), pp. 366–380.
CSL-2012-KieronskiM #transitive- Two-Variable Universal Logic with Transitive Closure (EK, JM), pp. 396–410.
CSL-2012-LeitschRP #towards- Towards CERes in intuitionistic logic (AL, GR, BWP), pp. 485–499.
ICLP-2012-BacciCFV #automation #functional #specification #synthesis- The additional difficulties for the automatic synthesis of specifications posed by logic features in functional-logic languages (GB, MC, MAF, AV), pp. 144–153.
ICLP-2012-Drabent - Logic + control: An example (WD), pp. 301–311.
ICLP-J-2012-Maher - Relative expressiveness of defeasible logics (MJM), pp. 793–810.
ICST-2012-MalzJG #fuzzy #testing #using- Prioritization of Test Cases Using Software Agents and Fuzzy Logic (CM, NJ, PG), pp. 483–486.
ICTSS-2012-YangHF #embedded #parametricity #query- Querying Parametric Temporal Logic Properties on Embedded Systems (HY, BH, GEF), pp. 136–151.
IJCAR-2012-BaaderMM #named #unification- UEL: Unification Solver for the Description Logic ℰℒ — System Description (FB, JM, BM), pp. 45–51.
IJCAR-2012-BorgwardtDP #fuzzy #how #question- How Fuzzy Is My Fuzzy Description Logic? (SB, FD, RP), pp. 82–96.
IJCAR-2012-GoreT #automation #reasoning- BDD-Based Automated Reasoning for Propositional Bi-Intuitionistic Tense Logics (RG, JT), pp. 301–315.
IJCAR-2012-HeamHK #linear- From Linear Temporal Logic Properties to Rewrite Propositions (PCH, VH, OK), pp. 316–331.
IJCAR-2012-KonevLW #difference- Logical Difference Computation with CEX2.5 (BK, ML, FW), pp. 371–377.
IJCAR-2012-RathsO #first-order #library #problem- The QMLTP Problem Library for First-Order Modal Logics (TR, JO), pp. 454–461.
IJCAR-2012-SteigmillerLG - Extended Caching, Backjumping and Merging for Expressive Description Logics (AS, TL, BG), pp. 514–529.
IJCAR-2012-Tiu - Stratification in Logics of Definitions (AT), pp. 544–558.
LICS-2012-AvronKZ #calculus #composition- Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics (AA, BK, AZ), pp. 85–94.
LICS-2012-BaeldeN #deduction #fixpoint- Combining Deduction Modulo and Logics of Fixed-Point Definitions (DB, GN), pp. 105–114.
LICS-2012-BarceloFL #graph #problem- Graph Logics with Rational Relations and the Generalized Intersection Problem (PB, DF, LL), pp. 115–124.
LICS-2012-ElberfeldGT #first-order #higher-order #monad- Where First-Order and Monadic Second-Order Logic Coincide (ME, MG, TT), pp. 265–274.
LICS-2012-GargGN #calculus #multi- Countermodels from Sequent Calculi in Multi-Modal Logics (DG, VG, SN), pp. 315–324.
LICS-2012-Herbelin #proving- A Constructive Proof of Dependent Choice, Compatible with Classical Logic (HH), pp. 365–374.
LICS-2012-KieronskiMPT #equivalence #first-order- Two-Variable First-Order Logic with Equivalence Closure (EK, JM, IPH, LT), pp. 431–440.
LICS-2012-MichaliszynO #decidability- Decidable Elementary Modal Logics (JM, JO), pp. 491–500.
LICS-2012-Nigam #complexity #linear #on the- On the Complexity of Linear Authorization Logics (VN), pp. 511–520.
LICS-2012-Platzer - Logics of Dynamical Systems (AP), pp. 13–24.
LICS-2012-SchalkS #linear #modelling #multi- Constructing Fully Complete Models for Multiplicative Linear Logic (AS, HPS), pp. 571–580.
LICS-2012-TraytelPB #category theory #composition #data type #higher-order #proving #theorem proving- Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving (DT, AP, JCB), pp. 596–605.
SMT-2012-KovasznaiFB #complexity #on the- On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width (GK, AF, AB), pp. 44–56.
TAP-2012-SulzmannZ #analysis #finite #linear- Constructive Finite Trace Analysis with Linear Temporal Logic (MS, AZ), pp. 132–148.
VMCAI-2012-RosenbergBN - Decision Procedures for Region Logic (SR, AB, DAN), pp. 379–395.
QoSA-ISARCS-2011-CostaM - Elective temporal logic (GC, IM), pp. 143–152.
PODS-2011-BojanczykF #documentation #evaluation #performance #xml- Efficient evaluation for a temporal logic on changing XML documents (MB, DF), pp. 259–270.
VLDB-2011-LometTZ #implementation #performance- Implementing Performance Competitive Logical Recovery (DBL, KT, MJZ), pp. 430–439.
VLDB-2011-NiuRDS #markov #named #network #scalability #statistics #using- Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS (FN, CR, AD, JWS), pp. 373–384.
ITiCSE-2011-Cervesato - Discovering logic through comics (IC), pp. 103–107.
ICSM-2011-Roover #detection #metaprogramming #object-oriented #source code- A logic meta-programming foundation for example-driven pattern detection in object-oriented programs (CDR), pp. 556–561.
DLT-J-2010-RigoW11 #finite #set- Logical Characterization of Recognizable Sets of polynomials over a Finite Field (MR, LW), pp. 1549–1563.
ICALP-v2-2011-AndersonMSS #first-order #invariant #locality #query- Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates (MA, DvM, NS, LS), pp. 368–379.
ICALP-v2-2011-CardelliLM #composition #markov- Modular Markovian Logic (LC, KGL, RM), pp. 380–391.
LATA-2011-Huschenbett #distributed #modelling #multi- Models for Quantitative Distributed Systems and Multi-Valued Logics (MH), pp. 310–322.
IFM-J-2009-Weiss11 #abstraction #calculus- Predicate abstraction in a program logic calculus (BW), pp. 861–876.
FM-2011-Li #compilation- Validated Compilation through Logic (GL), pp. 169–183.
SEFM-2011-CastroKAA #branch #fault tolerance #named #verification- dCTL: A Branching Time Temporal Logic for Fault-Tolerant System Verification (PFC, CK, AA, NA), pp. 106–121.
SEFM-2011-CrespoK #framework #relational- A Machine-Checked Framework for Relational Separation Logic (JMC, CK), pp. 122–137.
SEFM-2011-VriesK #hoare- Reverse Hoare Logic (EdV, VK), pp. 155–171.
TLCA-2011-Gimenez #difference #linear #normalisation #proving- Realizability Proof for Normalization of Full Differential Linear Logic (SG), pp. 107–122.
TLCA-2011-Lasson - Controlling Program Extraction in Light Logics (ML), pp. 123–137.
TLCA-2011-RehofU #combinator #finite- Finite Combinatory Logic with Intersection Types (JR, PU), pp. 169–183.
ICFP-2011-GesbertGL #morphism #parametricity #polymorphism #semantics #type system- Parametric polymorphism and semantic subtyping: the logical connection (NG, PG, NL), pp. 107–116.
ICFP-2011-ThamsborgB #program transformation- A kripke logical relation for effect-based program transformations (JT, LB), pp. 445–456.
IFL-2011-KoopmanAP #modelling #state machine #testing- Model Based Testing with Logical Properties versus State Machines (PWMK, PA, RP), pp. 116–133.
IFL-2011-Thomsen #functional #optimisation #using- Describing and Optimising Reversible Logic Using a Functional Language (MKT), pp. 148–163.
AIIDE-2011-HaRML #adaptation #game studies #markov #network #recognition- Goal Recognition with Markov Logic Networks for Player-Adaptive Games (EH, JPR, BWM, JCL).
FDG-2011-TreanorSBM #game studies #how #visual notation- Proceduralist readings: how to find meaning in games with graphical logics (MT, BS, IB, MM), pp. 115–122.
HIMI-v1-2011-PavelJ #approach #authentication #design #protocol- Routing Functionality in the Logic Approach for Authentication Protocol Design (OP, HJ), pp. 366–373.
CAiSE-2011-AsnarPM #case study #design pattern #modelling- Modeling Design Patterns with Description Logics: A Case Study (YA, EP, JM), pp. 169–183.
EDOC-2011-Halle #contract #message passing- Causality in Message-Based Contract Violations: A Temporal Logic “Whodunit” (SH), pp. 171–180.
EDOC-2011-Halpin #concept- Fact-Orientation and Conceptual Logic (TAH), pp. 14–19.
ICEIS-v2-2011-MeiJS #fuzzy- Passenger Travel Choice Prediciton based on Fuzzy Logic (LM, LJ, KS), pp. 163–166.
ICEIS-v4-2011-DavisC11a #data transformation #metadata #modelling- Variant Logic Meta-data Management for Model Driven Applications — Allows Unlimited End User Configuration and Customisation of All Meta-data EIS Application Features (JD, EC), pp. 395–400.
CIKM-2011-GoncalvesPS #categorisation #difference #ontology #owl- Categorising logical differences between OWL ontologies (RSG, BP, US), pp. 1541–1546.
KDD-2011-SatpalBSRS #information management #markov #network #using #web- Web information extraction using markov logic networks (SS, SB, SS, RR, PS), pp. 1406–1414.
KEOD-2011-Bab #integration #on the- On the Integration of Knowledge in a Propositional Logical Layer (SB), pp. 299–303.
KEOD-2011-MullerRH #modelling #towards- Towards a Description Logic for Scientific Modeling (JPM, HLR, DH), pp. 183–188.
KEOD-2011-StratosSG #reasoning- Episodic Logic: Natural Logic + Reasoning (KS, LKS, JG), pp. 304–310.
KEOD-2011-TripodiD - Linguistically based Qa by Dynamic Lod Access from Logical Forms (RT, RD), pp. 5–14.
ICMT-J-2010-TroyaV11 #atl #semantics- A Rewriting Logic Semantics for ATL (JT, AV), pp. 108–136.
LOPSTR-2011-MoralesHH #composition- Modular Extensions for Modular (Logic) Languages (JFM, MVH, RH), pp. 139–154.
PLDI-2011-Chlipala #low level #source code #verification- Mostly-automated verification of low-level programs in computational separation logic (AC), pp. 234–245.
PLDI-2011-PerezR #calculus #proving #theorem proving- Separation logic + superposition calculus = heap theorem prover (JANP, AR), pp. 556–566.
POPL-2011-HurD #assembly #ml- A kripke logical relation between ML and assembly (CKH, DD), pp. 133–146.
POPL-2011-MadhusudanPQ #decidability- Decidable logics combining heap structures and data (PM, GP, XQ), pp. 611–622.
POPL-2011-TuronW #concurrent- A separation logic for refining concurrent objects (AJT, MW), pp. 247–258.
PPDP-2011-InabaHHKN #higher-order #monad #using #verification- Graph-transformation verification using monadic second-order logic (KI, SH, ZH, HK, KN), pp. 17–28.
RE-2011-RaufAC #documentation #requirements- Logical structure extraction from software requirements documents (RR, MA, KC), pp. 101–110.
ESEC-FSE-2011-Ben-DavidCGU #named #specification- CSSL: a logic for specifying conditional scenarios (SBD, MC, AG, SU), pp. 37–47.
ESEC-FSE-2011-LumpeMG #named #specification- PSPWizard: machine-assisted definition of temporal logical properties with specification patterns (ML, IM, LG), pp. 468–471.
ICSE-2011-RosuS #approach #verification- Matching logic: a new program verification approach (GR, AS), pp. 868–871.
SAC-2011-Blech #encryption #proving #security- Proving the security of ElGamal encryption via indistinguishability logic (JOB), pp. 1625–1632.
DAC-2011-CevreroRSBIL #library #power management #standard- Power-gated MOS current mode logic (PG-MCML): a power aware DPA-resistant standard cell library (AC, FR, MS, SB, PI, YL), pp. 1014–1019.
DAC-2011-FuketaIYTNSS - A closed-form expression for estimating minimum operating voltage (VDDmin) of CMOS logic gates (HF, SI, TY, MT, MN, HS, TS), pp. 984–989.
DAC-2011-PuggelliWKS #question #robust #synthesis #tool support- Are logic synthesis tools robust? (AP, TW, AK, ALSV), pp. 633–638.
DAC-2011-TangWHH #incremental #multi #synthesis- Interpolation-based incremental ECO synthesis for multi-error logic rectification (KFT, CAW, PKH, CY(H), pp. 146–151.
DAC-2011-VelamalaLTC #design- Design sensitivity of single event transients in scaled logic circuits (JV, RL, MT, YC), pp. 694–699.
DAC-2011-ZukoskiYM - Universal logic modules based on double-gate carbon nanotube transistors (AZ, XY, KM), pp. 884–889.
DATE-2011-MedwedM #detection #fault- Arithmetic logic units with high error detection rates to counteract fault attacks (MM, SM), pp. 1644–1649.
DATE-2011-Micheli #design #physics #question #synthesis- Logic synthesis and physical design: Quo vadis? (GDM), p. 50.
DATE-2011-MirandaZDR #modelling #variability- Variability aware modeling for yield enhancement of SRAM and logic (MM, PZ, PD, PR), pp. 1153–1158.
DATE-2011-YuH #fault- Trigonometric method to handle realistic error probabilities in logic circuits (CCY, JPH), pp. 64–69.
DATE-2011-ZukoskiCM #synthesis- Reliability-driven don’t care assignment for logic synthesis (AZ, MRC, KM), pp. 1560–1565.
SOSP-2011-SirerBRSWWS #architecture- Logical attestation: an authorization architecture for trustworthy computing (EGS, WdB, PR, AS, KW, DW, FBS), pp. 249–264.
ESOP-2011-HoborG #concurrent- Barriers in Concurrent Separation Logic (AH, CG), pp. 276–296.
ESOP-2011-ParkinsonS - The Relationship between Separation Logic and Implicit Dynamic Frames (MJP, AJS), pp. 439–458.
TACAS-2011-AnnpureddyLFS #hybrid #named- S-TaLiRo: A Tool for Temporal Logic Falsification for Hybrid Systems (YA, CL, GEF, SS), pp. 254–257.
CADE-2011-AlpuenteBER #slicing- Backward Trace Slicing for Rewriting Logic Theories (MA, DB, JE, DR), pp. 34–48.
CADE-2011-BaaderBBM #concept #unification- Unification in the Description Logic EL without the Top Concept (FB, TBN, SB, BM), pp. 70–84.
CADE-2011-BrotherstonDP #automation #proving- Automated Cyclic Entailment Proofs in Separation Logic (JB, DD, RLP), pp. 131–146.
CADE-2011-Claessen #automation #first-order #reasoning- The Anatomy of Equinox — An Extensible Automated Reasoning Tool for First-Order Logic and Beyond — (KC), pp. 1–3.
CADE-2011-ClaessenLS #first-order- Sort It Out with Monotonicity — Translating between Many-Sorted and Unsorted First-Order Logic (KC, AL, NS), pp. 207–221.
CADE-2011-Platzer #difference #hybrid #probability #source code- Stochastic Differential Dynamic Logic for Stochastic Hybrid Programs (AP), pp. 446–460.
CADE-2011-Ranta #what- Translating between Language and Logic: What Is Easy and What Is Difficult (AR), pp. 5–25.
CAV-2011-DudkaPV #data type #named #using- Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation Logic (KD, PP, TV), pp. 372–378.
CAV-2011-Platzer #composition #hybrid #verification- Logic and Compositional Verification of Hybrid Systems — (AP), pp. 28–43.
CSL-2011-CantoneLA #decidability #order #quantifier #set- A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics (DC, CL, MNA), pp. 129–143.
CSL-2011-CardelliLM #axiom #markov #metric- Continuous Markovian Logic — From Complete Axiomatization to the Metric Space of Formulas (LC, KGL, RM), pp. 144–158.
CSL-2011-Czajka #approach #combinator #semantics- A Semantic Approach to Illative Combinatory Logic (LC0), pp. 174–188.
CSL-2011-DurandS #complexity #higher-order #problem #query- Enumeration Complexity of Logical Query Problems with Second-order Variables (AD, YS), pp. 189–202.
CSL-2011-Eickmeyer #first-order #random- Non-Definability Results for Randomised First-Order Logic (KE), pp. 218–232.
CSL-2011-GroheGHL #recursion- L-Recursion and a new Logic for Logarithmic Space (MG, BG, AH, BL), pp. 277–291.
CSL-2011-Kieronski #decidability #linear #order- Decidability Issues for Two-Variable Logics with Several Linear Orders (EK), pp. 337–351.
CSL-2011-ReusS #functional #source code- Relative Completeness for Logics of Functional Programs (BR, TS), pp. 470–480.
ICLP-2011-FodorK #transaction- Transaction Logic with Defaults and Argumentation Theories (PF, MK), pp. 162–174.
ICLP-2011-MolinaroSS #abduction #probability- Abduction in Annotated Probabilistic Temporal Logic (CM, AS, VSS), pp. 240–250.
ICLP-2011-NicholsonSS #generative #music #probability #using- Improving the Outcome of a Probabilistic Logic Music System Generator by Using Perlin Noise (CJN, DDS, JS), pp. 231–239.
ICLP-2011-Zombori #information retrieval #performance #reasoning- Two Phase Description Logic Reasoning for Efficient Information Retrieval (ZZ), pp. 296–300.
ICLP-J-2011-GutmannTKBR #probability #programming- The magic of logical inference in probabilistic programming (BG, IT, AK, MB, LDR), pp. 663–680.
ICLP-J-2011-Haemmerle #concurrent #constraints #linear- Observational equivalences for linear logic concurrent constraint languages (RH), pp. 469–485.
ISSTA-2011-TateishiPT #analysis #higher-order #monad #string- Path- and index-sensitive string analysis based on monadic second-order logic (TT, MP, OT), pp. 166–176.
LICS-2011-BresolinMSS #decidability #what- What’s Decidable about Halpern and Shoham’s Interval Logic? The Maximal Fragment ABBL (DB, AM, PS, GS), pp. 387–396.
LICS-2011-ChenF - Listings and Logics (YC, JF), pp. 165–174.
LICS-2011-Figueira #decidability #word- A Decidable Two-Way Logic on Data Words (DF), pp. 365–374.
LICS-2011-Heijltjes #linear #proving- Proof Nets for Additive Linear Logic with Units (WH), pp. 207–216.
LICS-2011-HurDV #garbage collection- Separation Logic in the Presence of Garbage Collection (CKH, DD, VV), pp. 247–256.
LICS-2011-KontinenKLV #complexity #dependence- Complexity of Two-Variable Dependence Logic and IF-Logic (JK, AK, PL, JV), pp. 289–298.
LICS-2011-MadelaineM #first-order #similarity- A Tetrachotomy for Positive First-Order Logic without Equality (FRM, BM), pp. 311–320.
LICS-2011-MarcinkowskiM - The Ultimate Undecidability Result for the Halpern-Shoham Logic (JM, JM), pp. 377–386.
LICS-2011-Tiwari #biology- Logic in Software, Dynamical and Biological Systems (AT), pp. 9–10.
ECSA-2010-BruckmannG #architecture #development #information management #maintenance #modelling- An Architectural Blueprint for Model Driven Development and Maintenance of Business Logic for Information Systems (TB, VG), pp. 53–69.
ECDL-2010-MeghiniSS #library #modelling- Modelling Digital Libraries Based on Logic (CM, NS, TS), pp. 2–13.
ECDL-2010-StrodlPGR #automation- Automating Logical Preservation for Small Institutions with Hoppla (SS, PP, MG, AR), pp. 124–135.
PODS-2010-HartmannL #dependence #sql- When data dependencies over SQL tables meet the logics of paradox and S-3 (SH, SL), pp. 317–326.
SIGMOD-2010-VaidyaLBDNX #configuration management #data type #named- Symbiote: a reconfigurable logic assisted data streammanagement system (RLADSMS) (PV, JJL, FB, YD, CHN, YX), pp. 1147–1150.
ICSM-2010-CanforaCCP #detection #empirical #multi #using- Using multivariate time series and association rules to detect logical change coupling: An empirical study (GC, MC, LC, MDP), pp. 1–10.
SCAM-2010-KatsV #aspect-oriented #case study #encapsulation #framework #platform #programming #using- Encapsulating Software Platform Logic by Aspect-Oriented Programming: A Case Study in Using Aspects for Language Portability (LCLK, EV), pp. 147–156.
DLT-2010-DrosteV #automaton #bound #multi #theorem- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices (MD, HV), pp. 160–172.
ICALP-v2-2010-BolligGMZ #automaton #transitive- Pebble Weighted Automata and Transitive Closure Logics (BB, PG, BM, MZ), pp. 587–598.
ICALP-v2-2010-ChenF #on the #proving- On p-Optimal Proof Systems and Logics for PTIME (YC, JF), pp. 321–332.
ICALP-v2-2010-MarcinkowskiMK #decidability- B and D Are Enough to Make the Halpern-Shoham Logic Undecidable (JM, JM, EK), pp. 357–368.
ICALP-v2-2010-MontanariPS #decidability- Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals (AM, GP, PS), pp. 345–356.
LATA-2010-GiampaoloTN #metric #parametricity- Parametric Metric Interval Temporal Logic (BDG, SLT, MN), pp. 249–260.
IFM-2010-AsirelliBFG #framework #variability- A Logical Framework to Deal with Variability (PA, MHtB, AF, SG), pp. 43–58.
RTA-2010-HillsR #approach #composition #program analysis #semantics- A Rewriting Logic Semantics Approach to Modular Program Analysis (MH, GR), pp. 151–160.
SEFM-2010-WeitlNF - Structured Counterexamples for the Temporal Description Logic ALCCTL (FW, SN, BF), pp. 232–243.
ICFP-2010-Crary #higher-order #representation- Higher-order representation of substructural logics (KC), pp. 131–142.
ICFP-2010-MazurakZ #concurrent #linear #named- Lolliproc: to concurrency from classical linear logic via curry-howard and control (KM, SZ), pp. 39–50.
ICFP-2010-StampoulisS #named- VeriML: typed computation of logical terms inside a language with effects (AS, ZS), pp. 333–344.
ICFP-2010-Tobin-HochstadtF - Logical types for untyped languages (STH, MF), pp. 117–128.
CIG-2010-OnievaCLL #fuzzy #using- Overtaking opponents with blocking strategies using fuzzy logic (EO, LC, DL, PLL), pp. 123–130.
CIG-2010-SmithNM #game studies #modelling #named- LUDOCORE: A logical game engine for modeling videogames (AMS, MJN, MM), pp. 91–98.
FDG-2010-TreanorMW #design #exclamation #game studies #using #visual notation- Kaboom! is a many-splendored thing: an interpretation and design methodology for message-driven games using graphical logics (MT, MM, NWF), pp. 224–231.
ICGT-2010-BalbianiEH #graph grammar- A Dynamic Logic for Termgraph Rewriting (PB, RE, AH), pp. 59–74.
CHI-2010-LiCEDL #automation #interactive #named #prototype #testing- FrameWire: a tool for automatically extracting interaction logic from paper prototyping tests (YL, XC, KE, MD, JAL), pp. 503–512.
ICML-2010-KokD #learning #markov #network #using- Learning Markov Logic Networks Using Structural Motifs (SK, PMD), pp. 551–558.
ICPR-2010-Meunier #analysis #assurance #automation #documentation #quality- Automated Quality Assurance for Document Logical Analysis (JLM), pp. 253–256.
KDIR-2010-Rauch #data mining #mining #semantics #web- Logic of Discovery, Data Mining and Semantic Web — Position Paper (JR), pp. 342–351.
KR-2010-Arieli #on the- On the Application of the Disjunctive Syllogism in Paraconsistent Logics Based on Four States of Information (OA).
KR-2010-ArieliAZ - Maximally Paraconsistent Three-Valued Logics (OA, AA, AZ).
KR-2010-Aucher - Characterizing Updates in Dynamic Epistemic Logic (GA).
KR-2010-BaaderBLW #query- Query and Predicate Emptiness in Description Logics (FB, MB, CL, FW).
KR-2010-BelardinelliL #first-order #interactive #multi- Interactions between Time and Knowledge in a First-order Logic for Multi-Agent Systems (FB, AL).
KR-2010-BienvenuLW - From Preference Logics to Preference Languages, and Back (MB, JL, NW).
KR-2010-BoellaGRT #comprehension- A Logical Understanding of Legal Interpretation (GB, GG, AR, LWNvdT).
KR-2010-CeramiEB #decidability- Decidability of a Description Logic over Infinite-Valued Product Logic (MC, FE, FB).
KR-2010-DitmarschEW - One Hundred Prisoners and a Lightbulb — Logic and Computation (HvD, JvE, WW).
KR-2010-KleinbergM - The Temporal Logic of Token Causes (SK, BM).
KR-2010-KonevLPW #ontology- Decomposing Description Logic Ontologies (BK, CL, DKP, FW).
KR-2010-KontchakovPZ - Interpreting Topological Logics over Euclidean Spaces (RK, IPH, MZ).
KR-2010-LutzS #nondeterminism #probability- Probabilistic Description Logics for Subjective Uncertainty (CL, LS).
KR-2010-PenalozaS #axiom #complexity #on the #product line- On the Complexity of Axiom Pinpointing in the EL Family of Description Logics (RP, BS).
KR-2010-Poole #semantics #towards- Towards a Logic of Feature-Based Semantic Science Theories (DP).
KR-2010-PorelloE #combinator #linear #modelling- Modelling Combinatorial Auctions in Linear Logic (DP, UE).
KR-2010-PradeR #reasoning- Reasoning with Logical Proportions (HP, GR).
KR-2010-Shapiro #semantics #syntax- Set-Oriented Logical Connectives: Syntax and Semantics (SCS).
KR-2010-WangWT #knowledge base- Revising General Knowledge Bases in Description Logics (ZW, KW, RWT).
SEKE-2010-Spector - Prodigious Data, Logic, Processing, and Usage (AZS), p. 1.
ICMT-2010-TroyaV #atl #semantics #towards- Towards a Rewriting Logic Semantics for ATL (JT, AV), pp. 230–244.
MoDELS-v1-2010-AmbroziewiczS #interactive #reuse- Application Logic Patterns — Reusable Elements of User-System Interaction (AA, MS), pp. 241–255.
ECOOP-2010-StadenCM #execution #object-oriented #specification #verification- Verifying Executable Object-Oriented Specifications with Separation Logic (SvS, CC, BM), pp. 151–174.
OOPSLA-2010-KloseO #composition #metaprogramming- Modular logic metaprogramming (KK, KO), pp. 484–503.
PEPM-2010-Haftmann #haskell #higher-order- From higher-order logic to Haskell: there and back again (FH), pp. 155–158.
POPL-2010-DreyerNRB #data type #higher-order #relational- A relational modal logic for higher-order stateful ADTs (DD, GN, AR, LB), pp. 185–198.
POPL-2010-GershenfeldDCKGDGS #automaton #configuration management- Reconfigurable asynchronous logic automata: (RALA) (NG, DD, KC, AK, FG, EDD, SG, PSN), pp. 1–6.
PPDP-2010-BaillotH #linear #type inference- Type inference in intuitionistic linear logic (PB, MH), pp. 219–230.
PPDP-2010-DowekG - Permissive-nominal logic (GD, MJG), pp. 165–176.
PPDP-2010-FodorK #transaction- Tabling for transaction logic (PF, MK), pp. 199–208.
SAS-2010-BellAW #concurrent #parallel #pipes and filters- Concurrent Separation Logic for Pipelined Parallelization (CJB, AWA, DW), pp. 151–166.
FSE-2010-KimGLR #named #query #re-engineering #refactoring- Ref-Finder: a refactoring reconstruction tool based on logic query templates (MK, MG, AL, NR), pp. 371–372.
SAC-2010-BelohlavekV10a #database #query #similarity- Query systems in similarity-based databases: logical foundations, expressive power, and completeness (RB, VV), pp. 1648–1655.
SAC-2010-DrumondG #concept #markov #ontology #using- Extracting ontology concept hierarchies from text using Markov logic (LD, RG), pp. 1354–1358.
CASE-2010-BraunS #approach #constraints #predict- A Mixed Logical Dynamic Model Predictive Control approach for handling industrially relevant transportation constraints (MWB, JS), pp. 966–971.
CASE-2010-ChaouiS #adaptation #fuzzy #nondeterminism- Adaptive fuzzy logic motion and posture control of inverted pendulums with unstructured uncertainties (HC, PS), pp. 638–643.
DAC-2010-DadgourHSB #analysis #design #energy #using- Design and analysis of compact ultra energy-efficient logic gates using laterally-actuated double-electrode NEMS (HFD, MMH, CS, KB), pp. 893–896.
DAC-2010-JindalAHLNW #detection- Detecting tangled logic structures in VLSI netlists (TJ, CJA, JH, ZL, GJN, CBW), pp. 603–608.
DAC-2010-TanachutiwatLWS #configuration management #multi- Reconfigurable multi-function logic based on graphene P-N junctions (ST, JUL, WW, CYS), pp. 883–888.
DAC-2010-WangZD #distributed #parallel #simulation- Distributed time, conservative parallel logic simulation on GPUs (BDW, YZ, YD), pp. 761–766.
DATE-2010-BollapalliKK #implementation- Implementing digital logic with sinusoidal supplies (KCB, SPK, LBK), pp. 315–318.
DATE-2010-ChoudhuryCMA #performance- Analytical model for TDDB-based performance degradation in combinational logic (MRC, VC, KM, RCA), pp. 423–428.
DATE-2010-JamaaMM #power management- Power consumption of logic circuits in ambipolar carbon nanotube technology (MHBJ, KM, GDM), pp. 303–306.
DATE-2010-LiSC #manycore- Exploiting local logic structures to optimize multi-core SoC floorplanning (CHL, SS, LPC), pp. 1291–1296.
DATE-2010-LiZHH #optimisation #synthesis- Reversible logic synthesis through ant colony optimization (ML, YZ, MSH, CH), pp. 307–310.
DATE-2010-LuckenbillLHMH #algorithm #analysis #fault #named #reliability- RALF: Reliability Analysis for Logic Faults — An exact algorithm and its applications (SBL, JYL, YH, RM, LH), pp. 783–788.
DATE-2010-MartinelloMRR #approach #multi #named #synthesis- KL-Cuts: A new approach for logic synthesis targeting multiple output blocks (OM, FSM, RPR, AIR), pp. 777–782.
DATE-2010-RitheGWDGBC #analysis #statistics- Non-linear Operating Point Statistical Analysis for Local Variations in logic timing at low voltage (RR, JG, AW, SD, GG, DB, AC), pp. 965–968.
DATE-2010-ShinG #approximate #fault #synthesis- Approximate logic synthesis for error tolerant applications (DS, SKG), pp. 957–960.
ESOP-2010-Atkey #analysis- Amortised Resource Analysis with Separation Logic (RA), pp. 85–103.
ESOP-2010-BaillotGM #functional #linear- A PolyTime Functional Language from Light Linear Logic (PB, MG, VM), pp. 104–124.
ESOP-2010-DeshmukhRRV #concurrent #proving- Logical Concurrency Control from Sequential Proofs (JVD, GR, VPR, KV), pp. 226–245.
ESOP-2010-FerreiraFS #concurrent #memory management #modelling- Parameterized Memory Models and Concurrent Separation Logic (RF, XF, ZS), pp. 267–286.
ESOP-2010-MeolaW #fault tolerance #reasoning #source code- Faulty Logic: Reasoning about Fault Tolerant Programs (MLM, DW), pp. 468–487.
ESOP-2010-NakataU #hoare #induction #semantics- A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While (KN, TU), pp. 488–506.
FoSSaCS-2010-AcciaiBZ #behaviour #on the #simulation- On the Relationship between Spatial Logics and Behavioral Simulations (LA, MB, GZ), pp. 146–160.
FoSSaCS-2010-NielsonN #model checking #static analysis- Model Checking Is Static Analysis of Modal Logic (FN, HRN), pp. 191–205.
TACAS-2010-GoreKP #algebra #algorithm- Optimal Tableau Algorithms for Coalgebraic Logics (RG, CK, DP), pp. 114–128.
TACAS-2010-LeinoR #design #encoding #polymorphism #verification- A Polymorphic Intermediate Verification Language: Design and Logical Encoding (KRML, PR), pp. 312–327.
WRLA-2010-BaeM #linear #maude #model checking- The Linear Temporal Logic of Rewriting Maude Model Checker (KB, JM), pp. 208–225.
WRLA-2010-Meseguer - Twenty Years of Rewriting Logic (JM), pp. 15–17.
CAV-2010-BasinKM #first-order #monitoring #policy- Policy Monitoring in First-Order Temporal Logic (DAB, FK, SM), pp. 1–18.
CAV-2010-GhorbalGP #approach- A Logical Product Approach to Zonotope Intersection (KG, EG, SP), pp. 212–226.
CSL-2010-BaazF - A Resolution Mechanism for Prenex Gödel Logic (MB, CGF), pp. 67–79.
CSL-2010-BenediktLP #automaton #word- Automata vs. Logics on Data Words (MB, CL, GP), pp. 110–124.
CSL-2010-BiancoMM - Graded Computation Tree Logic with Binary Coding (AB, FM, AM), pp. 125–139.
CSL-2010-Chaudhuri - Classical and Intuitionistic Subexponential Logics Are Equally Expressive (KC), pp. 185–199.
CSL-2010-ChurchillL - A Logic of Sequentiality (MC, JL), pp. 215–229.
CSL-2010-FinkbeinerS #coordination- Coordination Logic (BF, SS), pp. 305–319.
CSL-2010-FioreH #equation #higher-order- Second-Order Equational Logic (MPF, CKH), pp. 320–335.
CSL-2010-GanzowK #algorithm #higher-order #induction #monad- New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures (TG, LK), pp. 366–380.
CSL-2010-LohmannV #complexity #dependence- Complexity Results for Modal Dependence Logic (PL, HV), pp. 411–425.
CSL-2010-MartinM #complexity #first-order #similarity- The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case (BM, JM), pp. 426–438.
CSL-2010-NenovP #on the- On the Computability of Region-Based Euclidean Logics (YN, IPH), pp. 439–453.
CSL-2010-Platzer #difference #distributed #hybrid #quantifier- Quantified Differential Dynamic Logic for Distributed Hybrid Systems (AP), pp. 469–483.
CSL-2010-Pous #algebra #linear #proving- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic (DP), pp. 484–498.
CSL-2010-SchwentickZ #order- Two-Variable Logic with Two Order Relations — (TS, TZ), pp. 499–513.
ICLP-2010-Fages10 #biology #paradigm- A Logical Paradigm for Systems Biology (FF), pp. 2–3.
ICLP-2010-Fierens10 #modelling #performance #probability- Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization (DF), pp. 74–83.
ICLP-2010-Guenot10 #calculus #linear #proving- Focused Proof Search for Linear Logic in the Calculus of Structures (NG), pp. 84–93.
ICLP-2010-Pahlavi10 #higher-order #learning- Higher-order Logic Learning and λ-Progol (NP), pp. 281–285.
ICLP-J-2010-BaralGPS #case study #logic programming #modelling- Logic programming for finding models in the logics of knowledge and its applications: A case study (CB, GG, EP, TCS), pp. 675–690.
ICLP-J-2010-HouCD #fixpoint #rule-based- FO(FD): Extending classical logic with rule-based fixpoint definitions (PH, BdC, MD), pp. 581–596.
ICLP-J-2010-SneyersMVKS #learning #probability- CHR(PRISM)-based probabilistic logic learning (JS, WM, JV, YK, TS), pp. 433–447.
ICTSS-2010-Gladisch #first-order #generative #quantifier #source code #specification #testing- Test Data Generation for Programs with Quantified First-Order Logic Specifications (CG), pp. 158–173.
IJCAR-2010-BackesB #higher-order- Analytic Tableaux for Higher-Order Logic with Choice (JB, CEB), pp. 76–90.
IJCAR-2010-Benthem #complexity- Logic between Expressivity and Complexity (JvB), pp. 122–126.
IJCAR-2010-GlimmHM #reasoning- Optimized Description Logic Reasoning via Core Blocking (BG, IH, BM), pp. 457–471.
IJCAR-2010-GoreKPS #algebra- Global Caching for Coalgebraic Description Logics (RG, CK, DP, LS), pp. 46–60.
IJCAR-2010-GoreW - Optimal and Cut-Free Tableaux for Propositional Dynamic Logic with Converse (RG, FW), pp. 225–239.
IJCAR-2010-KaminskiS #hybrid- Terminating Tableaux for Hybrid Logic with Eventualities (MK, GS), pp. 240–254.
IJCAR-2010-Kazakov #axiom- An Extension of Complex Role Inclusion Axioms in the Description Logic SROIQ (YK), pp. 472–486.
IJCAR-2010-MagkaKH #data type- Tractable Extensions of the Description Logic EL with Numerical Datatypes (DM, YK, IH), pp. 61–75.
IJCAR-2010-MayerC #hybrid #proving- Herod and Pilate: Two Tableau Provers for Basic Hybrid Logic (MCM, SC), pp. 255–262.
IJCAR-2010-Nivelle - Classical Logic with Partial Functions (HdN), pp. 203–217.
LICS-2010-AvronAZ #on the- On Strong Maximality of Paraconsistent Finite-Valued Logics (AA, OA, AZ), pp. 304–313.
LICS-2010-BroadbentCOS #recursion- Recursion Schemes and Logical Reflection (CHB, AC, CHLO, OS), pp. 120–129.
LICS-2010-BrotherstonK - Undecidability of Propositional Separation Logic and Its Neighbours (JB, MIK), pp. 130–139.
LICS-2010-CaliGLMP #datalog #information management #product line #query #representation- Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications (AC, GG, TL, BM, AP), pp. 228–242.
LICS-2010-GuglielmiGS - Breaking Paths in Atomic Flows for Classical Logic (AG, TG, LS), pp. 284–293.
LICS-2010-Herbelin #markov #principle- An Intuitionistic Logic that Proves Markov’s Principle (HH), pp. 50–56.
LICS-2010-KreutzerT #bound #complexity #higher-order #monad- Lower Bounds for the Complexity of Monadic Second-Order Logic (SK, ST), pp. 189–198.
LICS-2010-Zeilberger #continuation- Polarity and the Logic of Delimited Continuations (NZ), pp. 219–227.
SAT-2010-BeyersdorffMMTV #complexity #proving- Proof Complexity of Propositional Default Logic (OB, AM, SM, MT, HV), pp. 30–43.
TAP-2010-AhnD #axiom #first-order #testing #verification- Testing First-Order Logic Axioms in Program Verification (KYA, ED), pp. 22–37.
VMCAI-2010-SanchezL #linear- Regular Linear Temporal Logic with Past (CS, ML), pp. 295–311.
ICDAR-2009-NtirogiannisGP #adaptation #documentation #image- A Modified Adaptive Logical Level Binarization Technique for Historical Document Images (KN, BG, IP), pp. 1171–1175.
EDM-2009-Barker-PlummerCD #first-order #natural language- Dimensions of Difficulty in Translating Natural Language into First-Order Logic (DBP, RC, RD), pp. 220–229.
SIGITE-2009-Stanley #architecture #education #hardware #network #operating system #simulation #using- Using digital logic simulation as a teaching aid in discrete mathematics, hardware and operating systems, networking, computer organization and computer architecture: a workshop outline (TDS), pp. 1–2.
ICSM-2009-WongC #impact analysis #modelling #predict- Predicting change impact from logical models (SW, YC), pp. 467–470.
WCRE-1999-RatiuMJ99a #composition #source code- The Logical Modularity of Programs (DR, RM, JJ), pp. 123–127.
DLT-2009-BolligG #probability- Weighted versus Probabilistic Logics (BB, PG), pp. 18–38.
DLT-2009-JeandelT - Subshifts, Languages and Logic (EJ, GT), pp. 288–299.
DLT-2009-MogaveroM #quantifier- Branching-Time Temporal Logics with Minimal Model Quantifiers (FM, AM), pp. 396–409.
DLT-2009-Quaas - Weighted Timed MSO Logics (KQ), pp. 419–430.
ICALP-v2-2009-DaxKL #on the- On Regular Temporal Logics with Past, (CD, FK, ML), pp. 175–187.
ICALP-v2-2009-MelliesTT #exponential #linear- An Explicit Formula for the Free Exponential Modality of Linear Logic (PAM, NT, CT), pp. 247–260.
LATA-2009-Courcelle #algorithm #graph #higher-order #monad- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (BC), pp. 19–22.
LATA-2009-Gierasimczuk #learning- Learning by Erasing in Dynamic Epistemic Logic (NG), pp. 362–373.
FM-2009-AhrendtBG - Abstract Object Creation in Dynamic Logic (WA, FSdB, IG), pp. 612–627.
FM-2009-AlpuenteBR #specification #verification #web- Specification and Verification of Web Applications in Rewriting Logic (MA, DB, DR), pp. 790–805.
FM-2009-Boute #unification- Making Temporal Logic Calculational: A Tool for Unification and Discovery (RTB), pp. 387–402.
IFM-2009-Weiss #abstraction #calculus- Predicate Abstraction in a Program Logic Calculus (BW), pp. 136–150.
RTA-2009-BaaderM #unification- Unification in the Description Logic EL (FB, BM), pp. 350–364.
SEFM-2009-BresolinGMS #constraints #integer- Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths (DB, VG, AM, GS), pp. 240–249.
SEFM-2009-TatsutaCA #pointer #verification- Completeness of Pointer Program Verification by Separation Logic (MT, WNC, MFAA), pp. 179–188.
TLCA-2009-BasaldellaT #on the- On the Meaning of Logical Completeness (MB, KT), pp. 50–64.
TLCA-2009-LagoH #bound #linear #revisited- Bounded Linear Logic, Revisited (UDL, MH), pp. 80–94.
TLCA-2009-Strassburger #higher-order #linear #multi #proving- Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic (LS), pp. 309–324.
TLCA-2009-TsukadaI #classification- A Logical Foundation for Environment Classifiers (TT, AI), pp. 341–355.
TLCA-2009-Vaux #difference #linear- Differential Linear Logic and Polarization (LV), pp. 371–385.
TLCA-2009-Zhang #reasoning- The Computational SLR: A Logic for Reasoning about Computational Indistinguishability (YZ), pp. 401–415.
DiGRA-2009-Wardrip-FruinM - Defining Operational Logics (NWF, MM).
DHM-2009-ZhengHLZLQ #feedback #fuzzy #nondeterminism- Fuzzy Logic in Exploring Data Effects: A Way to Unveil Uncertainty in EEG Feedback (FZ, BH, LL, TZ, YL, YQ), pp. 754–763.
HIMI-II-2009-Matsak #representation- Representing Logical Inference Steps with Digital Circuits (EM), pp. 178–184.
ICEIS-AIDSS-2009-LiH #aspect-oriented #framework- Formulating Aspects of Paypal in the Logic Framework of GBMF (ML, CJH), pp. 39–44.
ICEIS-AIDSS-2009-RoperoGLC #fuzzy #information management #novel #web- Term Weighting: Novel Fuzzy Logic based Method Vs. Classical TF-IDF Method for Web Information Extraction (JR, AG, CL, AC), pp. 130–137.
ICEIS-J-2009-CallegariB #fuzzy #multi #using- A Multi-criteria Resource Selection Method for Software Projects Using Fuzzy Logic (DAC, RMB), pp. 376–388.
ICML-2009-DavisD #higher-order #markov- Deep transfer via second-order Markov logic (JD, PMD), pp. 217–224.
ICML-2009-KokD #learning #markov #network- Learning Markov logic network structure via hypergraph lifting (SK, PMD), pp. 505–512.
KEOD-2009-ArkoudasBK #reasoning- Qualitative Spatial Reasoning Via 3-Valued Heterogeneous Logic (KA, SB, SK), pp. 80–87.
KEOD-2009-MatusiewiczMR - Reduced Implicate Tries and Logical Operations (AM, NVM, ER), pp. 456–459.
KEOD-2009-ZambachM #implementation #ontology- Applying Terminological Methods and Description Logic for Creating and Implementing an Ontology on Inhibition (SZ, BNM), pp. 452–455.
SIGIR-2009-ZucconAR #information retrieval- Revisiting logical imaging for information retrieval (GZ, LA, CJvR), pp. 766–767.
MoDELS-2009-DrusinskyS #uml #using- Using UML Statecharts with Knowledge Logic Guards (DD, MtS), pp. 586–590.
MoDELS-2009-DrusinskyS #uml #using- Using UML Statecharts with Knowledge Logic Guards (DD, MtS), pp. 586–590.
ECOOP-2009-SmansJP - Implicit Dynamic Frames: Combining Dynamic Frames and Separation Logic (JS, BJ, FP), pp. 148–172.
TOOLS-EUROPE-2009-NordioCMM #eiffel- A Sound and Complete Program Logic for Eiffel (MN, CC, PM, BM), pp. 195–214.
AdaEurope-2009-LauY #on the #testing- On Comparing Testing Criteria for Logical Decisions (MFL, YTY), pp. 44–58.
LOPSTR-2009-AlpuenteFJV #datalog- Defining Datalog in Rewriting Logic (MA, MAF, CJ, AV), pp. 188–204.
LOPSTR-2009-Nishimura #exception- Refining Exceptions in Four-Valued Logic (SN), pp. 113–127.
LOPSTR-2009-PettorossiPS #branch #program transformation- Deciding Full Branching Time Logic by Program Transformation (AP, MP, VS), pp. 5–21.
PADL-2009-TarauM - Interoperating Logic Engines (PT, AKM), pp. 137–151.
PEPM-2009-SimmonsP #approximate #linear- Linear logical approximations (RJS, FP), pp. 9–20.
POPL-2009-BrotherstonC #reasoning- Classical BI: a logic for reasoning about dualising resources (JB, CC), pp. 328–339.
POPL-2009-BrunelDHLM #model checking #using- A foundation for flow-based program matching: using temporal logic and model checking (JB, DD, RRH, JLL, GM), pp. 114–126.
PPDP-2009-NigamM #algorithm #linear #specification- Algorithmic specifications in linear logic with subexponentials (VN, DM), pp. 129–140.
PPDP-2009-Virseda #algorithm #debugging #declarative #framework #higher-order #source code #verification- A higher-order logical framework for the algorithmic debugging and verification of declarative programs (RdVV), pp. 49–60.
PPDP-2009-VlaeminckVD #framework- A logical framework for configuration software (HV, JV, MD), pp. 141–148.
QAPL-2009-Bernardo #markov #nondeterminism #probability #process #testing- Uniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes (MB), pp. 3–23.
ASE-2009-WongC #analysis #dependence #modelling #performance- Improving the Efficiency of Dependency Analysis in Logical Decision Models (SW, YC), pp. 173–184.
CASE-2009-AllenGT #nondeterminism #verification- Closed-loop determinism for non-deterministic environments: Verification for IEC 61499 logic controllers (LVA, KMG, DMT), pp. 1–6.
CASE-2009-BengtssonLYFB #development #specification- Operation-oriented specification for integrated control logic development (KB, BL, CY, PF, SB), pp. 183–190.
DAC-2009-BawiecN #synthesis- Boolean logic function synthesis for generalised threshold gate circuits (MAB, MN), pp. 83–86.
DAC-2009-ChoudhuryM #lookahead #optimisation #using- Timing-driven optimization using lookahead logic circuits (MRC, KM), pp. 390–395.
DAC-2009-PatilLZWM #using- Digital VLSI logic technology using Carbon Nanotube FETs: frequently asked questions (NP, AL, JZ, HSPW, SM), pp. 304–309.
DAC-2009-WilleD #scalability #synthesis- BDD-based synthesis of reversible logic for large functions (RW, RD), pp. 270–275.
DATE-2009-BobbaZPAM #design #standard #synthesis- Design of compact imperfection-immune CNFET layouts for standard-cell-based logic synthesis (SB, JZ, AP, DA, GDM), pp. 616–621.
DATE-2009-ChoudhuryM #fault- Masking timing errors on speed-paths in logic circuits (MRC, KM), pp. 87–92.
DATE-2009-JamaaMM #library #multi #novel #synthesis- Novel library of logic gates with ambipolar CNTFETs: Opportunities for multi-level logic synthesis (MHBJ, KM, GDM), pp. 622–627.
DATE-2009-KravetsM #synthesis #using- Sequential logic synthesis using symbolic bi-decomposition (VNK, AM), pp. 1458–1463.
DATE-2009-LomneMTRSC #evaluation #robust- Evaluation on FPGA of triple rail logic robustness against DPA and DEMA (VL, PM, LT, MR, RS, NC), pp. 634–639.
DATE-2009-MitraZPW #using- Imperfection-immune VLSI logic circuits using Carbon Nanotube Field Effect Transistors (SM, JZ, NP, HW), pp. 436–441.
DATE-2009-WuM #order #performance- Joint logic restructuring and pin reordering against NBTI-induced performance degradation (KCW, DM), pp. 75–80.
DATE-2009-YangSVBS #approximate- Sequential logic rectifications with approximate SPFDs (YSY, SS, AGV, RKB, DES), pp. 1698–1703.
DATE-2009-ZhengH #array #programmable #satisfiability- Defect-aware logic mapping for nanowire-based programmable logic arrays via satisfiability (YZ, CH), pp. 1279–1283.
PDP-2009-MathesSHF #named #programmable #web #web service- SOAP4PLC: Web Services for Programmable Logic Controllers (MM, CS, SH, BF), pp. 210–219.
WRLA-2008-AgrigoroaieiC09 #specification- Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors (OA, GC), pp. 5–22.
WRLA-2008-Hills09 #memory management #semantics- Memory Representations in Rewriting Logic Semantics Definitions (MH0), pp. 155–172.
ESOP-2009-RazaCG #automation #parallel- Automatic Parallelization with Separation Logic (MR, CC, PG), pp. 348–362.
FASE-2009-BoronatHM #model transformation #semantics #verification- Rewriting Logic Semantics and Verification of Model Transformations (AB, RH, JM), pp. 18–33.
FASE-2009-GrayM #testing- Logical Testing (KEG, AM), pp. 186–200.
FoSSaCS-2009-AntonopoulosD #graph- Separating Graph Logic from MSO (TA, AD), pp. 63–77.
FoSSaCS-2009-Gutierrez #bisimulation #concurrent #game studies- Logics and Bisimulation Games for Concurrency, Causality and Conflict (JG), pp. 48–62.
FoSSaCS-2009-Leivant #on the- On the Completeness of Dynamic Logic (DL), pp. 78–91.
FoSSaCS-2009-MyersPS #algebra #hybrid- Coalgebraic Hybrid Logic (RSRM, DP, LS), pp. 137–151.
CADE-2009-NguyenS #calculus- A Tableau Calculus for Regular Grammar Logics with Converse (LAN, AS), pp. 421–436.
CADE-2009-SebastianiV #analysis #axiom #encoding #lightweight- Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis (RS, MV), pp. 84–99.
CADE-2009-SutcliffeBBT #automation #development #higher-order #proving #theorem proving- Progress in the Development of Automated Theorem Proving for Higher-Order Logic (GS, CB, CEB, FT), pp. 116–130.
CAV-2009-McMillanKS - Generalizing DPLL to Richer Logics (KLM, AK, MS), pp. 462–476.
CSL-2009-FerreiraO #functional #linear- Functional Interpretations of Intuitionistic Linear Logic (GF, PO), pp. 3–19.
CSL-2009-Kreutzer #higher-order #monad #on the- On the Parameterised Intractability of Monadic Second-Order Logic (SK), pp. 348–363.
CSL-2009-MontanariPS #decidability- A Decidable Spatial Logic with Cone-Shaped Cardinal Directions (AM, GP, PS), pp. 394–408.
CSL-2009-Weber #complexity #on the- On the Complexity of Branching-Time Logics (VW), pp. 530–545.
ICLP-2009-King #abstraction #reverse engineering- Untangling Reverse Engineering with Logic and Abstraction (AK), p. 37.
ICLP-2009-Raedt #learning #probability #tutorial- Probabilistic Logic Learning — A Tutorial Abstract (LDR), p. 39.
ICLP-2009-Simkus #logic programming- Fusion of Logic Programming and Description Logics (MS), pp. 551–552.
ICST-2009-KaminskiA #detection #fault #testing #using- Using Logic Criterion Feasibility to Reduce Test Set Size While Guaranteeing Fault Detection (GKK, PA), pp. 356–365.
ICST-2009-KaminskiA09a #fault #mutation testing #performance #testing #using- Using a Fault Hierarchy to Improve the Efficiency of DNF Logic Mutation Testing (GKK, PA), pp. 386–395.
LICS-2009-BengtsonJPV #calculus #mobile #named #process- Psi-calculi: Mobile Processes, Nominal Data, and Logic (JB, MJ, JP, BV), pp. 39–48.
LICS-2009-BiancoMM - Graded Computation Tree Logic (AB, FM, AM), pp. 342–351.
LICS-2009-BojanczykSW #algebra- Wreath Products of Forest Algebras, with Applications to Tree Logics (MB, HS, IW), pp. 255–263.
LICS-2009-ChenF #problem- A Logic for PTIME and a Parameterized Halting Problem (YC, JF), pp. 397–406.
LICS-2009-DawarGHL #rank- Logics with Rank Operators (AD, MG, BH, BL), pp. 113–122.
LICS-2009-Dominguez #calculus #polymorphism #similarity- Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus (LD), pp. 81–90.
LICS-2009-DreyerAB - Logical Step-Indexed Logical Relations (DD, AA, LB), pp. 71–80.
LICS-2009-KazakovP #complexity #problem #satisfiability- A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics (YK, IPH), pp. 407–416.
LICS-2009-KieronskiT #equivalence #finite #first-order #on the #satisfiability- On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations (EK, LT), pp. 123–132.
LICS-2009-MadelaineM #complexity #first-order #similarity- The Complexity of Positive First-order Logic without Equality (FRM, BM), pp. 429–438.
LICS-2009-PaganiT #linear #problem- The Inverse Taylor Expansion Problem in Linear Logic (MP, CT), pp. 222–231.
SAT-2009-BeyersdorffMTV #complexity #reasoning- The Complexity of Reasoning for Fragments of Default Logic (OB, AM, MT, HV), pp. 51–64.
TAP-2009-FraserW #testing- Complementary Criteria for Testing Temporal Logic Properties (GF, FW), pp. 58–73.
VMCAI-2009-TalyGT #constraints #theorem proving #using- Synthesizing Switching Logic Using Constraint Solving (AT, SG, AT), pp. 305–319.
ECDL-2008-ZierauJ #design- Archive Design Based on Planets Inspired Logical Object Model (EZ, ASJ), pp. 37–40.
PODS-2008-Bojanzyk #effectiveness- Effective characterizations of tree logics (MB), pp. 53–66.
PODS-2008-CateS #automaton #transitive #xpath- XPath, transitive closure logic, and nested tree walking automata (BtC, LS), pp. 251–260.
EDM-2008-BarnesSLC #case study #proving #student #using- A pilot study on logic proof tutoring using hints generated from historical student data (TB, JCS, LL, MJC), pp. 197–201.
ITiCSE-2008-Kurmas #automation #performance #student #testing #using- Improving student performance using automated testing of simulated digital logic circuits (ZK), pp. 265–270.
ITiCSE-2008-PoplawskiK #design #named #simulation- JLS: a pedagogically targeted logic design and simulation tool (DAP, ZK), p. 314.
ITiCSE-2008-SalterD #multi #scalability #using- Using DLSim 3: a scalable, extensible, multi-level logic simulator (RMS, JLD), p. 315.
SIGITE-2008-Al-ZoubiJNNP #design #education #integration #online- Integration of an online digital logic design lab for it education (AYAZ, SJ, NN, JN, OP), pp. 237–242.
WCRE-2008-RobbesPL #fine-grained- Logical Coupling Based on Fine-Grained Change Information (RR, DP, ML), pp. 42–46.
DLT-J-2007-DiekertGK08 #finite #first-order #overview #word- A Survey on Small Fragments of First-Order Logic over Finite Words (VD, PG, MK), pp. 513–548.
CIAA-2008-EsikI #game studies- Games for Temporal Logics on Trees (ZÉ, SI), pp. 191–200.
DLT-2008-Morin #ambiguity- MSO Logic for Unambiguous Shared-Memory Systems (RM), pp. 516–528.
ICALP-A-2008-Courcelle #aspect-oriented #graph #higher-order #monad- Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects (BC), pp. 1–13.
ICALP-B-2008-BergerHY #abstraction #mobile #process- Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes (MB, KH, NY), pp. 99–111.
ICALP-B-2008-BirkedalRSY #higher-order- A Simple Model of Separation Logic for Higher-Order Store (LB, BR, JS, HY), pp. 348–360.
ICALP-B-2008-BojanczykS #first-order #quantifier- Tree Languages Defined in First-Order Logic with One Quantifier Alternation (MB, LS), pp. 233–245.
ICALP-B-2008-Mathissen #algebra #word- Weighted Logics for Nested Words and Algebraic Formal Power Series (CM), pp. 221–232.
ICALP-B-2008-SimmonsP #algorithm #linear- Linear Logical Algorithms (RJS, FP), pp. 336–347.
LATA-2008-Kahramanogullari #concurrent #linear #on the- On Linear Logic Planning and Concurrency (OK), pp. 250–262.
FM-2008-KitchinPM #distributed #simulation- Simulation, Orchestration and Logical Clocks (DK, EP, JM), p. 34.
RTA-2008-KuhlmannN #automaton #order- Logics and Automata for Totally Ordered Trees (MK, JN), pp. 217–231.
SEFM-2008-GorankoS #distributed #multi- Tableau-Based Decision Procedure for the Multi-agent Epistemic Logic with Operators of Common and Distributed Knowledge (VG, DS), pp. 237–246.
SFM-2008-Talcott - Pathway Logic (CLT), pp. 21–53.
AIIDE-2008-MagnussonD - Logical Agents for Language and Action (MM0, PD0).
ICGT-2008-Dodds - From Separation Logic to Hyperedge Replacement and Back (MD), pp. 484–486.
CSCW-2008-Christensen #architecture #design- The logic of practices of stigmergy: representational artifacts in architectural design (LRC), pp. 559–568.
ICEIS-AIDSS-2008-RybakovB #algorithm #multi- Algorithms for AI Logic of Decisions in Multi-Agent Environment (VVR, SB), pp. 125–129.
ICEIS-ISAS2-2008-AnicicS #framework #information management #towards- Towards Creation of Logical Framework for Event-Driven Information Systems (DA, NS), pp. 394–401.
CIKM-2008-ChanLY #modelling #using- Coreference resolution using expressive logic models (KC, WL, XY), pp. 1373–1374.
CIKM-2008-Domingos #information management #markov- Markov logic: a unifying language for knowledge and information management (PMD), p. 519.
ICML-2008-HuynhM #learning #markov #network #parametricity- Discriminative structure and parameter learning for Markov logic networks (TNH, RJM), pp. 416–423.
KR-2008-BaaderGL #axiom #ltl- LTL over Description Logic Axioms (FB, SG, CL), pp. 684–694.
KR-2008-BelardinelliL #first-order- A Complete First-Order Logic of Knowledge and Time (FB, AL), pp. 705–714.
KR-2008-Bienvenu #abduction #complexity #lightweight #product line- Complexity of Abduction in the EL Family of Lightweight Description Logics (MB), pp. 220–230.
KR-2008-BruijnET #ontology- Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic (JdB, TE, HT), pp. 485–495.
KR-2008-CalvaneseGLLR #constraints #identification- Path-Based Identification Constraints in Description Logics (DC, GDG, DL, ML, RR), pp. 231–241.
KR-2008-CalvaneseGLR #ontology #query- View-Based Query Answering over Description Logic Ontologies (DC, GDG, ML, RR), pp. 242–251.
KR-2008-CasaliGS #framework- A Logical Framework to Represent and Reason about Graded Preferences and Intentions (AC, LG, CS), pp. 27–37.
KR-2008-Chetcuti-SperandioL #how #strict- How to Choose Weightings to Avoid Collisions in a Restricted Penalty Logic (NCS, SL), pp. 340–347.
KR-2008-ClassenL #source code- A Logic for Non-Terminating Golog Programs (JC, GL), pp. 589–599.
KR-2008-HinrichsG #finite #how #injection #what- Injecting the How into the What: Investigating a Finite Classical Logic (TLH, MRG), pp. 92–192.
KR-2008-LoriniL - A Logical Account of Institutions: From Acceptances to Norms via Legislators (EL, DL), pp. 38–48.
KR-2008-RamanujamS #game studies- Dynamic Logic on Games with Structured Strategies (RR, SES), pp. 49–58.
KR-2008-SchroderP #how #strict- How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics (LS, DP), pp. 307–317.
KR-2008-TomanW #identification- Identifying Objects Over Time with Description Logics (DT, GEW), pp. 724–732.
KR-2008-WittocxMD #approximate #first-order #reasoning- Approximate Reasoning in First-Order Logic Theories (JW, MM, MD), pp. 103–112.
SEKE-2008-LiuLZL #protocol #security- Supremum of Agent Number Needed in Analyzing Security Protocols Based on Horn Logic (FL, ZL, TZ, ML), pp. 795–801.
SEKE-2008-PatroneR #bound #programming language- Sharing Application Logic Across Programming Language Boundaries (DSP, BR), pp. 227–231.
ECOOP-2008-BanerjeeNR #invariant #reasoning- Regional Logic for Local Reasoning about Global Invariants (AB, DAN, SR), pp. 387–411.
POPL-2008-BrotherstonBC #proving #termination- Cyclic proofs of program termination in separation logic (JB, RB, CC), pp. 101–112.
POPL-2008-ChinDNQ #composition #object-oriented #verification- Enhancing modular OO verification with separation logic (WNC, CD, HHN, SQ), pp. 87–99.
POPL-2008-GaboardiMR - A logical account of pspace (MG, JYM, SRDR), pp. 121–131.
POPL-2008-GulwaniMT #quantifier- Lifting abstract interpreters to quantified logical domains (SG, BM, AT), pp. 235–246.
POPL-2008-ParkinsonB #abstraction #inheritance- Separation logic, abstraction and inheritance (MJP, GMB), pp. 75–86.
QAPL-2008-FaellaLS #linear #model checking- Model Checking Quantitative Linear Time Logic (MF, AL, MS), pp. 61–77.
QAPL-2008-TzanisH #probability- Probabilistic Logic over Paths (ET, RH), pp. 79–96.
ASE-2008-JaspanQA #fault- Error Reporting Logic (CJ, TQ, JA), pp. 138–147.
SAC-2008-SavoldiG #physics- Logical and physical data collection of Windows CE based portable devices (AS, PG), pp. 1448–1449.
SAC-2008-SchroederM #xml- Conversion of generalization hierarchies and union types from extended entity-relationship model to an XML logical model (RS, RdSM), pp. 1036–1037.
CASE-2008-LjungkrantzAF #component #industrial #programming #specification #verification- Formal specification and verification of components for industrial logic control programming (OL, KÅ, MF), pp. 935–940.
DAC-2008-CzajkowskiB #composition #linear #synthesis- Functionally linear decomposition and synthesis of logic circuits for FPGAs (TSC, SDB), pp. 18–23.
DAC-2008-HoTDDGS #identification #verification- Early formal verification of conditional coverage points to identify intrinsically hard-to-verify logic (RCH, MT, MMD, ROD, JG, DES), pp. 268–271.
DAC-2008-Hurst #automation #synthesis- Automatic synthesis of clock gating logic with controlled netlist perturbation (APH), pp. 654–657.
DAC-2008-JamaaALM #programmable- Programmable logic circuits based on ambipolar CNFET (MHBJ, DA, YL, GDM), pp. 339–340.
DAC-2008-KrishnaswamyMH #design #on the #reliability- On the role of timing masking in reliable logic circuit design (SK, ILM, JPH), pp. 924–929.
DAC-2008-QianR #polynomial #probability #robust #synthesis- The synthesis of robust polynomial arithmetic with stochastic logic (WQ, MDR), pp. 648–653.
DATE-2008-AmelifardHFP #multi #stack- A Current Source Model for CMOS Logic Cells Considering Multiple Input Switching and Stack Effect (BA, SH, HF, MP), pp. 568–573.
DATE-2008-BrownTBP #automation #library #testing- Automated Testability Enhancements for Logic Brick Libraries (JGB, BT, RDB, LTP), pp. 480–485.
DATE-2008-ChatterjeeGHIKPS #realtime #reliability- Logical Reliability of Interacting Real-Time Tasks (KC, AG, TAH, DTI, CMK, CP, ALSV), pp. 909–914.
DATE-2008-ChoudhuryM #approximate #concurrent #detection #fault- Approximate logic circuits for low overhead, non-intrusive concurrent error detection (MRC, KM), pp. 903–908.
DATE-2008-CopeCL #configuration management #gpu #memory management #using- Using Reconfigurable Logic to Optimise GPU Memory Accesses (BC, PYKC, WL), pp. 44–49.
DATE-2008-DongZ #integration #standard #synthesis- Logic Synthesis with Nanowire Crossbar: Reality Check and Standard Cell-based Integration (MD, LZ), pp. 268–271.
DATE-2008-FeinsteinTM #detection #equivalence #using- Partially Redundant Logic Detection Using Symbolic Equivalence Checking in Reversible and Irreversible Logic Circuits (DYF, MAT, DMM), pp. 1378–1381.
DATE-2008-PomeranzR #detection #fault- A Bridging Fault Model Where Undetectable Faults Imply Logic Redundancy (IP, SMR), pp. 1166–1171.
DATE-2008-VemuJAPG #concurrent #detection #fault #low cost- A low-cost concurrent error detection technique for processor control logic (RV, AJ, JAA, SP, RG), pp. 897–902.
DATE-2008-WilleLDG #quantifier #synthesis- Quantified Synthesis of Reversible Logic (RW, HML, GWD, DG), pp. 1015–1020.
DATE-2008-ZhangPM #design #guidelines- Design Guidelines for Metallic-Carbon-Nanotube-Tolerant Digital Logic Circuits (JZ, NP, SM), pp. 1009–1014.
ESOP-2008-HoborAN #concurrent #semantics- Oracle Semantics for Concurrent Separation Logic (AH, AWA, FZN), pp. 353–367.
FASE-2008-MossakowskiSG #reasoning- A Generic Complete Dynamic Logic for Reasoning About Purity and Effects (TM, LS, SG), pp. 199–214.
FASE-2008-OrejasEP #constraints #graph- A Logic of Graph Constraints (FO, HE, UP), pp. 179–198.
FoSSaCS-2008-BonsangueRS #algebra #automaton #synthesis- Coalgebraic Logic and Synthesis of Mealy Machines (MMB, JJMMR, AS), pp. 231–245.
FoSSaCS-2008-GargA #data access- A Modal Deconstruction of Access Control Logics (DG, MA), pp. 216–230.
FoSSaCS-2008-PattinsonS #algebra #finite #modelling #rank #semantics- Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics (DP, LS), pp. 66–80.
TACAS-2008-TsayCTCL #automaton #research #towards- GOAL Extended: Towards a Research Tool for ω Automata and Temporal Logic (YKT, YFC, MHT, WCC, CJL), pp. 346–350.
SMT-2007-RozanovS08 #constraints #generative #similarity #transitive- Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic (MR, OS), pp. 3–17.
CAV-2008-OHearn #tutorial- Tutorial on Separation Logic (PWO), pp. 19–21.
CSL-2008-HamanoT #linear #multi- An Indexed System for Multiplicative Additive Polarized Linear Logic (MH, RT), pp. 262–277.
CSL-2008-HodkinsonMS #axiom- Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T (IMH, AM, GS), pp. 308–322.
CSL-2008-LagoL #game studies #linear #semantics- Quantitative Game Semantics for Linear Logic (UDL, OL), pp. 230–245.
CSL-2008-Place - Characterization of Logics over Ranked Tree Languages (TP), pp. 401–415.
CSL-2008-Tranquilli #correctness #linear #multi #semantics- A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic (PT), pp. 246–261.
ICLP-2008-BuccafurriCL #reasoning #semantics #social- A Logic Language with Stable Model Semantics for Social Reasoning (FB, GC, RL), pp. 718–723.
ICLP-2008-Fink #programming- Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There (MF), pp. 99–113.
ICLP-2008-LukacsySK #prolog #reasoning- Prolog Based Description Logic Reasoning (GL, PS, BK), pp. 455–469.
ICLP-2008-Montanari - Back to Interval Temporal Logics (AM), pp. 11–13.
ICLP-2008-NearBF #declarative #first-order #named #proving #theorem proving- αleanTAP: A Declarative Theorem Prover for First-Order Classical Logic (JPN, WEB, DPF), pp. 238–252.
ICLP-2008-OHearn #tutorial- Separation Logic Tutorial (PWO), pp. 15–21.
ICLP-2008-PearceV #equilibrium #quantifier #set #source code- Quantified Equilibrium Logic and Foundations for Answer Set Programs (DP, AV), pp. 546–560.
ICLP-2008-PiancastelliO #multi #web- A Multi-theory Logic Language for the World Wide Web (GP, AO), pp. 769–773.
ICLP-2008-PiazzaP #biology #modelling- Systems Biology: Models and Logics (CP, AP), p. 14.
ICLP-2008-Tarau - Logic Engines as Interactors (PT), pp. 703–707.
ICST-2008-RamirezC #adaptation #modelling #uml #verification- Verifying and Analyzing Adaptive Logic through UML State Models (AJR, BHCC), pp. 529–532.
IJCAR-2008-BenzmullerPTF #automation #higher-order #named #proving #theorem proving- LEO-II — A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (CB, LCP, FT, AF), pp. 162–170.
IJCAR-2008-BenzmullerRS #higher-order #named- THF0 — The Core of the TPTP Language for Higher-Order Logic (CB, FR, GS), pp. 491–506.
IJCAR-2008-BozgaIP #source code- Quantitative Separation Logic and Programs with Lists (MB, RI, SP), pp. 34–49.
IJCAR-2008-KaminskiS #difference #hybrid- Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse (MK, GS), pp. 210–225.
IJCAR-2008-KonevWW #difference #problem- The Logical Difference Problem for Description Logic Terminologies (BK, DW, FW), pp. 259–274.
IJCAR-2008-Korovin #first-order #named #proving #theorem proving- iProver — An Instantiation-Based Theorem Prover for First-Order Logic (KK), pp. 292–298.
IJCAR-2008-Lutz #complexity #query- The Complexity of Conjunctive Query Answering in Expressive Description Logics (CL), pp. 179–193.
IJCAR-2008-MotikH #reasoning #reuse- Individual Reuse in Description Logic Reasoning (BM, IH), pp. 242–258.
IJCAR-2008-MouraB #effectiveness #set #using- Deciding Effectively Propositional Logic Using DPLL and Substitution Sets (LMdM, NB), pp. 410–425.
IJCAR-2008-NigamM #linear- Focusing in Linear Meta-logic (VN, DM), pp. 507–522.
IJCAR-2008-Otten #agile #performance #proving #theorem proving- leanCoP 2.0and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (JO), pp. 283–291.
IJCAR-2008-PerezV #effectiveness #proving- Proof Systems for Effectively Propositional Logic (JANP, AV), pp. 426–440.
IJCAR-2008-Schack-NielsenS #concurrent #deduction #framework #named- Celf — A Logical Framework for Deductive and Concurrent Systems (ASN, CS), pp. 320–326.
IJCAR-2008-SchmidtT #first-order- A General Tableau Method for Deciding Description Logics, Modal Logics and Related First-Order Fragments (RAS, DT), pp. 194–209.
LICS-2008-CiabattoniGT #axiom- From Axioms to Analytic Rules in Nonclassical Logics (AC, NG, KT), pp. 229–240.
LICS-2008-Grohe - The Quest for a Logic Capturing PTIME (MG), pp. 267–271.
LICS-2008-Lynch #modelling- A Logical Characterization of Individual-Based Models (JFL), pp. 379–390.
LICS-2008-PlotkinP #algebra- A Logic for Algebraic Effects (GDP, MP), pp. 118–129.
LICS-2008-SchurmannS - Structural Logical Relations (CS, JS), pp. 69–80.
LICS-2008-Staton #category theory #semantics- General Structural Operational Semantics through Categorical Logic (SS), pp. 166–177.
SAT-2008-MarienWDB #induction #satisfiability- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions (MM, JW, MD, MB), pp. 211–224.
VMCAI-2008-KupfermanL #automaton #game studies #multi #simulation- Multi-valued Logics, Automata, Simulations, and Games (OK, YL), p. 5.
VMCAI-2008-NguyenKC #runtime- Runtime Checking for Separation Logic (HHN, VK, WNC), pp. 203–217.
VMCAI-2008-Schmidt #abstract interpretation- Internal and External Logics of Abstract Interpretations (DAS), pp. 263–278.
DocEng-2007-DejeanM #documentation #functional- Logical document conversion: combining functional and formal knowledge (HD, JLM), pp. 135–143.
ECDL-2007-Frommholz #documentation #probability #retrieval- Annotation-Based Document Retrieval with Probabilistic Logics (IF), pp. 321–332.
ECDL-2007-KongL #multi #using #xml- Using XML Logical Structure to Retrieve (Multimedia) Objects (ZK, ML), pp. 100–111.
ECDL-2007-Martinez-PrietoFVA #using #xml- Electronic Work : Building Dynamic Services over Logical Structure Using Aqueducts for XML Processing (MAMP, PdlF, JV, JA), pp. 445–448.
ICDAR-2007-BeusekomKSB #documentation #image- Example-Based Logical Labeling of Document Title Page Images (JvB, DK, FS, TMB), pp. 919–923.
ICDAR-2007-ChenMT #documentation #layout #recognition- Simultaneous Layout Style and Logical Entity Recognition in a Heterogeneous Collection of Documents (SC, SM, GT), pp. 118–122.
ICDAR-2007-EspositoFMB #automation #documentation #first-order #incremental #learning #web- Incremental Learning of First Order Logic Theories for the Automatic Annotations of Web Documents (FE, SF, NDM, TMAB), pp. 1093–1097.
ICDAR-2007-MinagawaFTF #analysis #image #layout- Logical Structure Analysis for Form Images with Arbitrary Layout by Belief Propagation (AM, YF, HT, KF), pp. 714–718.
VLDB-2007-RomanK #behaviour #concurrent #reasoning #semantics #transaction #web #web service- Reasoning about the Behavior of Semantic Web Services with Concurrent Transaction Logic (DR, MK), pp. 627–638.
ITiCSE-2007-Arnold #interactive #learning- Introducing propositional logic and queueing theory with the infotraffic interactive learning environments (RA), p. 356.
CIAA-2007-DrosteR #automaton- Weighted Automata and Weighted Logics with Discounting (MD, GR), pp. 73–84.
DLT-2007-Matthissen - Definable Transductions and Weighted Logics for Texts (CM), pp. 324–336.
ICALP-2007-AtseriasBD07a #equation- Affine Systems of Equations and Counting Infinitary Logic (AA, AAB, AD), pp. 558–570.
ICALP-2007-LuttgenV #concurrent #exclamation #simulation- Ready Simulation for Concurrency: It’s Logical! (GL, WV), pp. 752–763.
ICALP-2007-SchroderP #algorithm #composition- Modular Algorithms for Heterogeneous Modal Logics (LS, DP), pp. 459–471.
LATA-2007-BaaderHP #automaton #exclamation- SI! Automata Can Show PSPACE Results for Description Logics (FB, JH, RP), pp. 67–78.
LATA-2007-BolligK #automaton #message passing- Muller Message-Passing Automata and Logics (BB, DK), pp. 163–174.
IFM-2007-GheorghiuGC #query- Finding State Solutions to Temporal Logic Queries (MG, AG, MC), pp. 273–292.
RTA-2007-HillsR #analysis #named #prototype- KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis (MH, GR), pp. 246–256.
RTA-2007-Pfenning #on the- On a Logical Foundation for Explicit Substitutions (FP), p. 19.
SEFM-2007-Bayley #design pattern #formal method- Formalising Design Patterns in Predicate Logic (IB), pp. 25–36.
SEFM-2007-BeckertK #concurrent #deduction #source code #verification- A Dynamic Logic for Deductive Verification of Concurrent Programs (BB, VK), pp. 141–150.
SEFM-2007-CastroM #fault tolerance #reasoning- An ought-to-do deontic logic for reasoning about fault-tolerance: the diarrheic philosophers (PFC, TSEM), pp. 151–160.
TLCA-2007-Baillot #linear #polynomial #type system- From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing (PB), pp. 2–7.
TLCA-2007-Fiore #difference #linear #modelling #multi- Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic (MPF), pp. 163–177.
TLCA-2007-Pfenning #on the- On a Logical Foundation for Explicit Substitutions (FP), p. 1.
ICEIS-AIDSS-2007-RaimondiPVM #fuzzy- A New Fuzzy Logic Controller for Trading on the Stock Market (FMR, SP, PV, MM), pp. 322–329.
ICEIS-EIS-2007-Sarbo #on the- On the Logic Underlying Common Sense (JJS), pp. 395–400.
ICEIS-J-2007-Castro-SchezVBG #approach #e-commerce #fuzzy- A Fuzzy Logic Based Approach to Improve Cataloguing and Searching in e-Commerce Portals (JJCS, DVF, LRB, JMG), pp. 316–327.
ICML-2007-MihalkovaM #bottom-up #learning #markov #network- Bottom-up learning of Markov logic network structure (LM, RJM), pp. 625–632.
SEKE-2007-SalamahKG #generative #linear #specification- Generating Linear Temporal Logic Formulas for Pattern-Based Specifications (SS, VK, AQG), pp. 422–427.
SIGIR-2007-Forst #documentation #summary- A summarisation logic for structured documents (JFF), p. 919.
SPLC-2007-CzarneckiW #diagrams #feature model- Feature Diagrams and Logics: There and Back Again (KC, AW), pp. 23–34.
SPLC-2007-JanotaK #feature model #higher-order #modelling #reasoning- Reasoning about Feature Models in Higher-Order Logic (MJ, JRK), pp. 13–22.
PADL-2007-Liang #aspect-oriented #higher-order #linear #programming- Aspect-Oriented Programming in Higher-Order and Linear Logic (CCL), pp. 305–319.
PADL-2007-PodelskiR #abstraction #model checking #named #refinement- ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement (AP, AR), pp. 245–259.
PEPM-2007-RooverDBND #behaviour #query #similarity #source code #using- Behavioral similarity matching using concrete source code templates in logic queries (CDR, TD, JB, CN, LD), pp. 92–101.
POPL-2007-CalcagnoGZ #parametricity- Context logic as modal logic: completeness and parametric inexpressivity (CC, PG, UZ), pp. 123–134.
POPL-2007-TuchKN - Types, bytes, and separation logic (HT, GK, MN), pp. 97–108.
QAPL-2007-BaltazarMNP #probability- Exogenous Probabilistic Computation Tree Logic (PB, PM, RN, NP), pp. 95–110.
QAPL-2007-CianciaF #algebra #modelling- Co-Algebraic Models for Quantitative Spatial Logics (VC, GLF), pp. 43–58.
SAS-2007-Brotherston #induction #reasoning- Formalised Inductive Reasoning in the Logic of Bunched Implications (JB), pp. 87–103.
SIGAda-2007-PukiteL #design #simulation #using- Generic discrete event simulations using DEGAS: application to logic design and digital signal processing (PP, LL), pp. 27–40.
SAC-2007-GhourabiITMK #algebra #axiom- Logical and algebraic view of Huzita’s origami axioms with applications to computational origami (FG, TI, HT, MM, AK), pp. 767–772.
CASE-2007-GomezHR #fuzzy #maintenance- Decision Making Based on Fuzzy Logic for Product Subcontracting Taking into Account Maintenance Actions (RAFG, SH, NR), pp. 771–776.
CASE-2007-LjungkrantzA #case study #component #industrial #library #programming #using- A Study of Industrial Logic Control Programming using Library Components (OL, KÅ), pp. 117–122.
CASE-2007-RugnoneVNDCPT #design #named #visual notation- HomeTL: A visual formalism, based on temporal logic, for the design of home based care (AR, EV, CDN, MPD, DC, CP, ET), pp. 747–752.
DAC-2007-LiuONG #configuration management #design #novel- Novel CNTFET-based Reconfigurable Logic Gate Design (JL, IO, DN, FG), pp. 276–277.
DAC-2007-TaylorP #combinator #design #optimisation #physics- Exact Combinatorial Optimization Methods for Physical Design of Regular Logic Bricks (BT, LTP), pp. 344–349.
DAC-2007-ZhouTLW #how- How Much Can Logic Perturbation Help from Netlist to Final Routing for FPGAs (CLZ, WCT, WHL, YLW), pp. 922–927.
DATE-2007-ChoudhuryM #analysis #reliability #scalability- Accurate and scalable reliability analysis of logic circuits (MRC, KM), pp. 1454–1459.
DATE-2007-RaoOK #fault tolerance #interactive- Interactive presentation: Logic level fault tolerance approaches targeting nanoelectronics PLAs (WR, AO, RK), pp. 865–869.
ISMM-2007-OHearn #concurrent #resource management- Separation logic and concurrent resource management (PWO), p. 1.
WRLA-J-2004-CervesatoS07 #dependent type #representation #specification- Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types (IC, MOS), pp. 3–35.
WRLA-2006-DenkerTRBES07 - Rewriting Logic Systems (GD, CLT, GR, MvdB, SE, TFS), pp. 233–247.
WRLA-2006-SasseM07 #algebra #hoare #java #semantics #verification- Java+ITP: A Verification Tool Based on Hoare Logic and Algebraic Semantics (RS, JM), pp. 29–46.
WRLA-2006-WirsingDTPB07 #constraints #framework- A Rewriting Logic Framework for Soft Constraints (MW, GD, CLT, AP, LB), pp. 181–197.
ESOP-2007-FengFS #concurrent #on the #reasoning- On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning (XF, RF, ZS), pp. 173–188.
ESOP-2007-LiOS #compilation #higher-order #set- Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic (GL, SO, KS), pp. 205–219.
FoSSaCS-2007-BaulandSSSV #complexity #linear #satisfiability- The Complexity of Generalized Satisfiability for Linear Temporal Logic (MB, TS, HS, IS, HV), pp. 48–62.
FoSSaCS-2007-BengtsonP #formal method #using #π-calculus- Formalising the π-Calculus Using Nominal Logic (JB, JP), pp. 63–77.
FoSSaCS-2007-BirkedalY #parametricity #relational- Relational Parametricity and Separation Logic (LB, HY), pp. 93–107.
FoSSaCS-2007-ParmaS #bisimulation #probability- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems (AP, RS), pp. 287–301.
FoSSaCS-2007-YoshidaHB #higher-order #reasoning- Logical Reasoning for Higher-Order Functions with Local State (NY, KH, MB), pp. 361–377.
TACAS-2007-FranzleH - Deciding an Interval Logic with Accumulated Durations (MF, MRH), pp. 201–215.
TACAS-2007-KuglerPSH #framework #modelling #predict- “Don’t Care” Modeling: A Logical Framework for Developing Predictive System Models (HK, AP, MJS, EJAH), pp. 343–357.
TACAS-2007-MyreenG #hoare- Hoare Logic for Realistically Modelled Machine Code (MOM, MJCG), pp. 568–582.
TACAS-2007-PandyaKL #abstraction #on the- On Sampling Abstraction of Continuous Time Logic with Durations (PKP, SNK, KL), pp. 246–260.
SMT-J-2006-GanaiTG #difference #encoding #integration #lazy evaluation #named- SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in Solving Difference Logic (MKG, MT, AG), pp. 91–114.
SMT-J-2006-KimJS #difference #finite #integer- Disequality Management in Integer Difference Logic via Finite Instantiations (HK, HJ, FS), pp. 47–66.
CADE-2007-Baumgartner - Logical Engineering with Instance-Based Methods (PB), pp. 404–409.
CADE-2007-HeilalaP #bidirectional- Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4 (SH, BP), pp. 116–131.
CADE-2007-LiS #compilation #higher-order- Compilation as Rewriting in Higher Order Logic (GL, KS), pp. 19–34.
CADE-2007-LutzW #lightweight- Conservative Extensions in the Lightweight Description Logic EL (CL, FW), pp. 84–99.
CADE-2007-MotikSH #reasoning #using- Optimized Reasoning in Description Logics Using Hypertableaux (BM, RS, IH), pp. 67–83.
CADE-2007-PerezV #bound #effectiveness #encoding #ltl #model checking- Encodings of Bounded LTL Model Checking in Effectively Propositional Logic (JANP, AV), pp. 346–361.
CADE-2007-TiwariG #program analysis #proving #theorem proving #using- Logical Interpretation: Static Program Analysis Using Theorem Proving (AT, SG), pp. 147–166.
CAV-2007-CimattiRST #abstraction #satisfiability- Boolean Abstraction for Temporal Logic Satisfiability (AC, MR, VS, ST), pp. 532–546.
CSL-2007-AehligB - Propositional Logic for Circuit Classes (KA, AB), pp. 512–526.
CSL-2007-Dawar #automaton #first-order #locality #model checking- Model-Checking First-Order Logic: Automata and Locality (AD), p. 6.
CSL-2007-DawarR #finite #power of #strict- The Power of Counting Logics on Restricted Classes of Finite Structures (AD, DR), pp. 84–98.
CSL-2007-FiliotTT #satisfiability- Satisfiability of a Spatial Logic with Tree Variables (EF, JMT, ST), pp. 130–145.
CSL-2007-FournierGGZ - Classical and Intuitionistic Logic Are Asymptotically Identical (HF, DG, AG, MZ), pp. 177–193.
CSL-2007-LiangM - Focusing and Polarization in Intuitionistic Logic (CL, DM), pp. 451–465.
CSL-2007-MillerS #composition #linear #proving- From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic (DM, AS), pp. 405–419.
CSL-2007-RabinovichT #problem- Logical Refinements of Church’s Problem (AR, WT), pp. 69–83.
ICLP-2007-KoninckSD #algorithm- The Correspondence Between the Logical Algorithms Language and CHR (LDK, TS, BD), pp. 209–223.
ICLP-2007-Nguyen #approximate #complexity #knowledge base- Approximating Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity (LAN), pp. 438–439.
LICS-2007-AlurABEIL #first-order #word- First-Order and Temporal Logics for Nested Words (RA, MA, PB, KE, NI, LL), pp. 151–160.
LICS-2007-BaillotCL #complexity #reduction- Light Logics and Optimal Reduction: Completeness and Complexity (PB, PC, UDL), pp. 421–430.
LICS-2007-Bojanczyk - Two-way unary temporal logic over trees (MB), pp. 121–130.
LICS-2007-BonsangueK #π-calculus- π-Calculus in Logical Form (MMB, AK), pp. 303–312.
LICS-2007-CalcagnoOY - Local Action and Abstract Separation Logic (CC, PWO, HY), pp. 366–378.
LICS-2007-CateBV #first-order #theorem- Lindstrom theorems for fragments of first-order logic (BtC, JvB, JAV), pp. 280–292.
LICS-2007-Klin #algebra #semantics- Bialgebraic Operational Semantics and Modal Logic (BK), pp. 336–345.
LICS-2007-Oliva #linear- Modified Realizability Interpretation of Classical Linear Logic (PO), pp. 431–442.
LICS-2007-Schopp #bound- Stratified Bounded Affine Logic for Logarithmic Space (US), pp. 411–420.
SAT-2007-EenMS #satisfiability #synthesis- Applying Logic Synthesis for Speeding Up SAT (NE, AM, NS), pp. 272–286.
SAT-2007-PerezV #effectiveness #encoding #problem- Encodings of Problems in Effectively Propositional Logic (JANP, AV), p. 3.
TAP-2007-RummerS #calculus #java #proving #source code #using- Proving Programs Incorrect Using a Sequent Calculus for Java Dynamic Logic (PR, MAS), pp. 41–60.
VMCAI-2007-NguyenDQC #automation #verification- Automated Verification of Shape and Size Properties Via Separation Logic (HHN, CD, SQ, WNC), pp. 251–266.
JCDL-2006-FrommholzF #library #object-oriented #probability #retrieval- Probabilistic, object-oriented logics for annotation-based retrieval in digital libraries (IF, NF), pp. 55–64.
PODS-2006-BojanczykDMSS #reasoning #xml- Two-variable logic on data trees and XML reasoning (MB, CD, AM, TS, LS), pp. 10–19.
PODS-2006-FranconiT #rdf #tutorial- The logic of RDF and SPARQL: a tutorial (EF, ST), p. 355.
CSMR-2006-DucasseGW #legacy #object-oriented #testing- Object-Oriented Legacy System Trace-based Logic Testing (SD, TG, RW), pp. 37–46.
MSR-2006-DAmbrosLL #evolution #visualisation- The evolution radar: visualizing integrated logical coupling information (MD, ML, ML), pp. 26–32.
MSR-2006-SigonneauR #automation #component #file system #multi #re-engineering- Software engineering applications of logic file system: application to automated multi-criteria indexation of software components (BS, OR), pp. 87–93.
WCRE-2006-DAmbrosL #reverse engineering- Reverse Engineering with Logical Coupling (MD, ML), pp. 189–198.
DLT-2006-DrosteR #automaton #infinity #word- Weighted Automata and Weighted Logics on Infinite Words (MD, GR), pp. 49–58.
DLT-2006-Kufleitner - Polynomials, Fragments of Temporal Logic and the Variety DA over Traces (MK), pp. 37–48.
ICALP-v2-2006-CorinH #encryption #game studies #hoare #probability #proving- A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs (RC, JdH), pp. 252–263.
ICALP-v2-2006-GuerriniM #commutative #linear #multi #quantifier- Commutative Locative Quantifiers for Multiplicative Linear Logic (SG, PM), pp. 396–407.
ICALP-v2-2006-HondaBY #higher-order- Descriptive and Relative Completeness of Logics for Higher-Order Functions (KH, MB, NY), pp. 360–371.
FM-2006-Mostowski #java #reasoning- Formal Reasoning About Non-atomic Java Card Methods in Dynamic Logic (WM), pp. 444–459.
FM-2006-Preoteasa #pointer #recursion #using #verification- Mechanical Verification of Recursive Procedures Manipulating Pointers Using Separation Logic (VP), pp. 508–523.
RTA-2006-Obua #higher-order- Checking Conservativity of Overloaded Definitions in Higher-Order Logic (SO), pp. 212–226.
IFL-2006-ChitilH #haskell #lazy evaluation- A Pattern Logic for Prompt Lazy Assertions in Haskell (OC, FH), pp. 126–144.
ICGT-2006-Jackson #modelling- Idioms of Logical Modelling (DJ), p. 14.
CAiSE-2006-HaggmarkA #analysis #principle #why- Why Software Engineers Do Not Keep to the Principle of Separating Business Logic from Display: A Method Rationale Analysis (MH, PJÅ), pp. 399–413.
ICEIS-AIDSS-2006-CalegariC #fuzzy #ontology- Integrating Fuzzy Logic in Ontologies (SC, DC), pp. 66–73.
ICEIS-J-2006-KoutsomitropoulosMKP06a #framework #reasoning #semantics #web- Establishing the Semantic Web Reasoning Infrastructure on Description Logic Inference Engines (DAK, DPM, ANK, TSP), pp. 351–362.
ICEIS-SAIC-2006-KoutsomitropoulosMKP #information management #using- OWL-Based Knowledge Discovery Using Description Logics Reasoners (DAK, DPM, ANK, TSP), pp. 43–50.
ICPR-v1-2006-Bayro-CorrochanoM #algebra #fuzzy #geometry #using- Object Manipulation using Fuzzy Logic and Geometric Algebra (EBC, RMC), pp. 1120–1123.
ICPR-v1-2006-MaoXTT #documentation #image #multi #recognition- Logical Entity Recognition in Multi-Style Document Page Images (SM, ZX, TT, GRT), pp. 876–879.
KR-2006-AgotnesA #semantics- Semantics for Dynamic Syntactic Epistemic Logics (TÅ, NA), pp. 411–419.
KR-2006-BesnardH #compilation #knowledge base #performance- Knowledgebase Compilation for Efficient Logical Argumentation (PB, AH), pp. 123–133.
KR-2006-BonattiLW - Description Logics with Circumscription (PAB, CL, FW), pp. 400–410.
KR-2006-CabalarOP #semantics- Logical Foundations of Well-Founded Semantics (PC, SPO, DP), pp. 25–35.
KR-2006-CalvaneseGLLR #complexity #query- Data Complexity of Query Answering in Description Logics (DC, GDG, DL, ML, RR), pp. 260–270.
KR-2006-CateCMV - Definitorially Complete Description Logics (BtC, WC, MM, YV), pp. 79–89.
KR-2006-GhilardiLW #ontology- Did I Damage My Ontology? A Case for Conservative Extensions in Description Logics (SG, CL, FW), pp. 187–197.
KR-2006-Jauregui #imperative #semantics- Semantical Considerations for a Logic of Actions: An Imperative Manifesto (VJ), pp. 371–376.
KR-2006-LiuLMW - Updating Description Logic ABoxes (HL, CL, MM, FW), pp. 46–56.
KR-2006-LukasiewiczS - Variable-Strength Conditional Preferences for Matchmaking in Description Logics (TL, JS), pp. 164–174.
KR-2006-Rosati #datalog #integration- DL+log: Tight Integration of Description Logics and Disjunctive Datalog (RR), pp. 68–78.
KR-2006-SannerM #calculus #first-order #hybrid #reasoning- An Ordered Theory Resolution Calculus for Hybrid Reasoning in First-Order Extensions of Description Logic (SS, SAM), pp. 100–111.
KR-2006-SirinGP #optimisation #reasoning- From Wine to Water: Optimizing Description Logic Reasoning for Nominals (ES, BCG, BP), pp. 90–99.
KR-2006-ZamanskyA #first-order #nondeterminism #semantics- Non-Deterministic Semantics for First-Order Paraconsistent Logics (AZ, AA), pp. 431–439.
SEKE-2006-SunZLT #component #composition #design #execution #framework- Abstract Logic Tree based Framework for Component Based Solution Composition Design and Execution (WS, XZ, YL, ZT), pp. 268–273.
ECMDA-FA-2006-OKeefe #consistency #semantics #uml- Dynamic Logic Semantics for UML Consistency (GO), pp. 113–127.
QAPL-2005-HirschLT06 - A Logic for Application Level QoS (DH, ALL, ET), pp. 135–159.
QAPL-2005-NicolaKLM06 #performance #towards- Towards a Logic for Performance and Mobility (RDN, JPK, DL, MM), pp. 161–175.
LOPSTR-2006-BrasselFH #functional #program transformation- A Program Transformation for Tracing Functional Logic Computations (BB, SF, FH), pp. 160–176.
PADL-2006-NagyLS #prolog #query- Translating Description Logic Queries to Prolog (ZN, GL, PS), pp. 168–182.
POPL-2006-AmtoftBB #data flow #object-oriented #source code- A logic for information flow in object-oriented programs (TA, SB, AB), pp. 91–102.
POPL-2006-BishopFNSSW #implementation #specification #testing- Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations (SB, MF, MN, PS, MS, KW), pp. 55–66.
PPDP-2006-GabbayM - One-and-a-halfth-order logic (MG, AM), pp. 189–200.
PPDP-2006-RooverBD #behaviour #fuzzy #similarity #strict #validation- Combining fuzzy logic and behavioral similarity for non-strict program validation (CDR, JB, TD), pp. 15–26.
SAS-2006-Arnold #analysis #refinement #using- Specialized 3-Valued Logic Shape Analysis Using Structure-Based Refinement and Loose Embedding (GA), pp. 204–220.
SAS-2006-OHearn #program analysis- Separation Logic and Program Analysis (PWO), p. 181.
ASE-2006-CaiS #analysis #composition #design #modelling- Modularity Analysis of Logical Design Models (YC, KJS), pp. 91–102.
ASE-2006-Ireland #automation #refinement #towards- Towards Automatic Assertion Refinement for Separation Logic (AI), pp. 309–312.
ICSE-2006-PadioleauSR #file system #information management #named- LISFS: a logical information system as a file system (YP, BS, OR), pp. 803–806.
SAC-2006-Cheng #information management- Deontic relevant logic as the logical basis for legal information systems (JC), pp. 319–320.
SAC-2006-GotoC #analysis- A quantitative analysis of implicational paradoxes in classical mathematical logic (YG, JC), pp. 42–43.
GPCE-2006-PerryJW #contract #linear- Expressing heap-shape contracts in linear logic (FP, LJ, DW), pp. 101–110.
DAC-2006-FatemiNP #analysis #statistics #using- Statistical logic cell delay analysis using a current-based model (HF, SN, MP), pp. 253–256.
DAC-2006-KeaneEKSK #framework- Subthreshold logical effort: a systematic framework for optimal subthreshold device sizing (JK, HE, TTHK, SSS, CHK), pp. 425–428.
DAC-2006-MishchenkoCB #fresh look #synthesis- DAG-aware AIG rewriting a fresh look at combinational logic synthesis (AM, SC, RKB), pp. 532–535.
DAC-2006-RaoOK #architecture- Topology aware mapping of logic functions onto nanowire-based crossbar architectures (WR, AO, RK), pp. 723–726.
DAC-2006-WagnerBA #design- Shielding against design flaws with field repairable control logic (IW, VB, TMA), pp. 344–347.
DAC-2006-WangGG #deduction #difference #learning- Predicate learning and selective theory deduction for a difference logic solver (CW, AG, MKG), pp. 235–240.
DATE-2006-BanerjeeRMB #fine-grained #power management #synthesis #using- Low power synthesis of dynamic logic circuits using fine-grained clock gating (NB, KR, HMM, SB), pp. 862–867.
DATE-2006-GillPW #analysis #fault- Soft delay error analysis in logic circuits (BSG, CAP, FGW), pp. 47–52.
DATE-2006-KrautzP0TWV #detection #fault #formal method #using- Evaluating coverage of error detection logic for soft errors using formal methods (UK, MP, CJ, HWT, KW, HTV), pp. 176–181.
DATE-2006-LiuH #synthesis- Crosstalk-aware domino logic synthesis (YYL, TH), pp. 1312–1317.
DATE-DF-2006-ArifinC #adaptation #clustering #implementation #novel #segmentation- A novel FPGA-based implementation of time adaptive clustering for logical story unit segmentation (SA, PYKC), pp. 227–232.
ESOP-2006-Ahmed #quantifier #recursion- Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types (AJA), pp. 69–83.
FoSSaCS-2006-LodingS #recursion #source code- Propositional Dynamic Logic with Recursive Programs (CL, OS), pp. 292–306.
FoSSaCS-2006-OuaknineW #metric #on the #turing machine- On Metric Temporal Logic and Faulty Turing Machines (JO, JW), pp. 217–230.
FoSSaCS-2006-Schroder #algebra #finite- A Finite Model Construction for Coalgebraic Modal Logic (LS), pp. 157–171.
FoSSaCS-2006-YorshRSMB #linked data #open data- A Logic of Reachable Patterns in Linked Data-Structures (GY, AMR, MS, AM, AB), pp. 94–110.
STOC-2006-Feldman #approximate #learning #query- Hardness of approximate two-level logic minimization and PAC learning with membership queries (VF), pp. 363–372.
TACAS-2006-DistefanoOY #analysis- A Local Shape Analysis Based on Separation Logic (DD, PWO, HY), pp. 287–302.
TACAS-2006-GanaiTG #encoding #integration #lazy evaluation #named- SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in a Separation Logic Solver (MKG, MT, AG), pp. 135–150.
TACAS-2006-KroeningS #approximate #image- Approximating Predicate Images for Bit-Vector Logic (DK, NS), pp. 242–256.
TACAS-2006-OuaknineW #decidability #metric #safety- Safety Metric Temporal Logic Is Fully Decidable (JO, JW), pp. 411–425.
CAV-2006-RosuB #linear #ltl #monitoring #synthesis- Allen Linear (Interval) Temporal Logic — Translation to LTL and Monitor Synthesis (GR, SB), pp. 263–277.
CSL-2006-ArtemovK #complexity #proving- Logical Omniscience Via Proof Complexity (SNA, RK), pp. 135–149.
CSL-2006-AtassiBT #system f #verification- Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic (VA, PB, KT), pp. 150–166.
CSL-2006-GollerL #infinity #model checking- Infinite State Model-Checking of Propositional Dynamic Logics (SG, ML), pp. 349–364.
CSL-2006-HellaT #higher-order #problem- Complete Problems for Higher Order Logics (LH, JMTT), pp. 380–394.
CSL-2006-Madelaine - Universal Structures and the Logic of Forbidden Patterns (FRM), pp. 471–485.
CSL-2006-Marcinkowski #graph #on the #power of- On the Expressive Power of Graph Logic (JM), pp. 486–500.
CSL-2006-MartinMO #hoare- Hoare Logic in the Abstract (UM, EAM, PO), pp. 501–515.
CSL-2006-Pagani #exponential #linear #multi- Acyclicity and Coherence in Multiplicative Exponential Linear Logic (MP), pp. 531–545.
CSL-2006-ReusS #higher-order- Separation Logic for Higher-Order Store (BR, JS), pp. 575–590.
CSL-2006-Segoufin #automaton #infinity #word- Automata and Logics for Words and Trees over an Infinite Alphabet (LS), pp. 41–57.
CSL-2006-Truszczynski #algebra- Nonmonotonic Logics and Their Algebraic Foundations (MT), pp. 58–71.
FATES-RV-2006-FainekosP #robust #specification- Robustness of Temporal Logic Specifications (GEF, GJP), pp. 178–192.
ICLP-2006-BrandY #towards- Towards “Propagation = Logic + Control” (SB, RHCY), pp. 102–116.
ICLP-2006-CabalarOPV #equilibrium #semantics #using- Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic (PC, SPO, DP, AV), pp. 346–360.
ICLP-2006-Emden #composition #semantics- Compositional Semantics for the Procedural Interpretation of Logic (MHvE), pp. 315–329.
ICLP-2006-Lukacsy #prolog #reasoning- Description Logic Reasoning in Prolog (GL), pp. 463–464.
ICLP-2006-OrtizV #combinator #natural language #using- Natural Language Processing Using Lexical and Logical Combinators (JFO, JV), pp. 444–446.
ICLP-2006-Pientka #framework #performance #verification- Overcoming Performance Barriers: Efficient Verification Techniques for Logical Frameworks (BP), pp. 3–10.
IJCAR-2006-BeckertP - Dynamic Logic with Non-rigid Functions (BB, AP), pp. 266–280.
IJCAR-2006-BenzmullerBK - Cut-Simulation in Impredicative Logics (CB, CEB, MK), pp. 220–234.
IJCAR-2006-ChaudhuriPP - A Logical Characterization of Forward and Backward Chaining in the Inverse Method (KC, FP, GP), pp. 97–111.
IJCAR-2006-DemriL - Presburger Modal Logic Is PSPACE-Complete (SD, DL), pp. 541–556.
IJCAR-2006-DyckhoffKL #bound #calculus- Strong Cut-Elimination Systems for Hudelmaier’s Depth-Bounded Sequent Calculus for Implicational Logic (RD, DK, SL), pp. 347–361.
IJCAR-2006-GelderS #automation #generative #higher-order #parsing- Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation (AVG, GS), pp. 156–161.
IJCAR-2006-Krauss #higher-order #recursion- Partial Recursive Functions in Higher-Order Logic (AK), pp. 589–603.
IJCAR-2006-Rabe #dependent type #first-order- First-Order Logic with Dependent Types (FR), pp. 377–391.
IJCAR-2006-TomanW #dependence #functional #on the- On Keys and Functional Dependencies as First-Class Citizens in Description Logics (DT, GEW), pp. 647–661.
IJCAR-2006-TsarkovH - FaCT++ Description Logic Reasoner: System Description (DT, IH), pp. 292–297.
LICS-2006-BarthM #linear #using- Managing Digital Rights using Linear Logic (AB, JCM), pp. 127–136.
LICS-2006-Blass #adaptation- Adapting Logics (AB), p. 123.
LICS-2006-BojanczykMSSD #word- Two-Variable Logic on Words with Data (MB, AM, TS, LS, CD), pp. 7–16.
LICS-2006-Dawson #assessment- Shaken Foundations or Groundbreaking Realignment? A Centennial Assessment of Kurt Gödel’s Impact on Logic, Mathematics, and Computer Science (JWD), pp. 339–341.
LICS-2006-HaymanW #concurrent #independence- Independence and Concurrent Separation Logic (JH, GW), pp. 147–156.
LICS-2006-KupfermanV - Memoryful Branching-Time Logic (OK, MYV), pp. 265–274.
LICS-2006-KuskeL #automaton #monad- Monadic Chain Logic Over Iterations and Applications to Pushdown Systems (DK, ML), pp. 91–100.
LICS-2006-Lago #complexity #linear #semantics- Context Semantics, Linear Logic and Computational Complexity (UDL), pp. 169–178.
LICS-2006-Leivant #proving #reasoning #source code- Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic (DL), pp. 157–168.
LICS-2006-Otto #bound #first-order #monad #problem- The Boundedness Problem for Monadic Universal First-Order Logic (MO), pp. 37–48.
LICS-2006-ParkinsonBC #hoare- Variables as Resource in Hoare Logics (MJP, RB, CC), pp. 137–146.
LICS-2006-SchroderP #bound- PSPACE Bounds for Rank-1 Modal Logics (LS, DP), pp. 231–242.
LICS-2006-VaraccaV #model checking- Temporal Logics and Model Checking for Fairly Correct Systems (DV, HV), pp. 389–398.
SAT-2006-SebastianiV #case study #encoding #satisfiability- Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ALC (RS, MV), pp. 130–135.
TestCom-2006-RodriguezMN #testing- A Logic for Assessing Sets of Heterogeneous Testing Hypotheses (IR, MGM, MN), pp. 39–54.
VMCAI-2006-BinghamR #abstraction #source code- A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs (JDB, ZR), pp. 207–221.
VMCAI-2006-HristovaL #algorithm #automaton #linear #model checking- Improved Algorithm Complexities for Linear Temporal Logic Model Checking of Pushdown Systems (KH, YAL), pp. 190–206.
VMCAI-2006-TanA #composition #control flow- A Compositional Logic for Control Flow (GT, AWA), pp. 80–94.
CBSE-2005-CooperCLSSW #component #empirical #fuzzy #specification #using- An Empirical Study on the Specification and Selection of Components Using Fuzzy Logic (KMLC, JWC, RL, GS, RS, WEW), pp. 155–170.
WICSA-2005-Riva #architecture #re-engineering- Bridging the Concrete and Logical Domains for Software Architecture Reconstruction (CR), pp. 263–264.
HT-2005-DmitrievLS #documentation #hypermedia- As we may perceive: inferring logical documents from hypertext (PD, CL, BS), pp. 66–74.
ICDAR-2005-CeciBM #comprehension #documentation #image #learning #relational #statistics- Relational Learning techniques for Document Image Understanding: Comparing Statistical and Logical approaches (MC, MB, DM), pp. 473–477.
ICDAR-2005-HadjarI #using- Logical Labeling of Arabic Newspapers using Artificial Neural Nets (KH, RI), pp. 426–431.
ICDAR-2005-RangoniB #categorisation #documentation #recognition- Data categorization for a context return applied to logical document structure recognition (YR, AB), pp. 297–301.
ICDAR-2005-ZhangBZ #fuzzy #using- Using Fuzzy Logic to Analyze Superscript and Subscript Relations in Handwritten Mathematical Expressions (LZ, DB, RZ), pp. 972–976.
VLDB-2005-KassoffZGG #named #spreadsheet- PrediCalc: A Logical Spreadsheet Management System (MK, LMZ, AG, MRG), pp. 1247–1250.
CSMR-2005-BoronatCR #automation #re-engineering #using- Automatic Reengineering in MDA Using Rewriting Logic as Transformation Engine (AB, JÁC, IR), pp. 228–231.
CIAA-2005-KleinB #automaton #linear- Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic (JK, CB), pp. 199–212.
ICALP-2005-ConfortiMS #graph- Spatial Logics for Bigraphs (GC, DM, VS), pp. 766–778.
ICALP-2005-DattaDMST #polynomial #probability #protocol #security #semantics- Probabilistic Polynomial-Time Semantics for a Protocol Security Logic (AD, AD, JCM, VS, MT), pp. 16–29.
ICALP-2005-DrosteG #automaton- Weighted Automata and Weighted Logics (MD, PG), pp. 513–525.
ICALP-2005-Libkin #overview #perspective- Logics for Unranked Trees: An Overview (LL), pp. 35–50.
ICALP-2005-ReusS #higher-order #hoare- About Hoare Logics for Higher-Order Store (BR, TS), pp. 1337–1348.
RTA-2005-BonevaT #automaton- Automata and Logics for Unranked and Unordered Trees (IB, JMT), pp. 500–515.
SEFM-2005-BarthePS #analysis #memory management #precise #using- Precise Analysis of Memory Consumption using Program Logics (GB, MP, GS), pp. 86–95.
SEFM-2005-Chalin #question #what- Logical Foundations of Program Assertions: What do Practitioners Want? (PC), pp. 383–393.
SEFM-2005-GeorgievaM #analysis- Description Logics for Shape Analysis (LG, PM), pp. 321–331.
TLCA-2005-AbelC #algorithm #framework #similarity- Untyped Algorithmic Equality for Martin-Löf’s Logical Framework with Surjective Pairs (AA, TC), pp. 23–38.
TLCA-2005-BaillotT #algorithm #type system- A Feasible Algorithm for Typing in Elementary Affine Logic (PB, KT), pp. 55–70.
TLCA-2005-CoppolaLR #call-by #λ-calculus- Elementary Affine Logic and the Call-by-Value λ Calculus (PC, UDL, SRDR), pp. 131–145.
TLCA-2005-Herbelin #on the- On the Degeneracy of Σ-Types in Presence of Computational Classical Logic (HH), pp. 209–220.
TLCA-2005-LamarcheS #proving- Naming Proofs in Classical Propositional Logic (FL, LS), pp. 246–261.
ICFP-2005-BergerHY #alias #analysis #higher-order #imperative- A logical analysis of aliasing in imperative higher-order functions (MB, KH, NY), pp. 280–293.
ICEIS-v1-2005-OuziriVF #approach #integration #modelling #topic- Data Integration and User Modelling: An Approach Based on Topic Maps and Description Logics (MO, CV, AF), pp. 171–175.
ECIR-2005-Rijsbergen #information retrieval #probability- A Probabilistic Logic for Information Retrieval (CJvR), pp. 1–6.
ICML-2005-KokD #learning #markov #network- Learning the structure of Markov logic networks (SK, PMD), pp. 441–448.
SEKE-2005-KuoH #design #fuzzy #ontology- Incorporating Fuzzy Logic in Ontology-Based Agent System Design (JYK, NLH), pp. 187–192.
SEKE-2005-Wang #infinity #model checking #specification- Specification of an Infinite-State Local Model Checker in Rewriting Logic (BYW), pp. 442–447.
QAPL-2004-Huth05 #abstraction #hybrid- Abstraction and Probabilities for Hybrid Logics (MH), pp. 61–76.
LOPSTR-2005-Fages #automaton #constraints- Temporal Logic Constraints in the Biochemical Abstract Machine BIOCHAM (FF), pp. 1–5.
PADL-2005-WangGL #code generation #continuation #semantics #towards- Towards Provably Correct Code Generation via Horn Logical Continuation Semantics (QW, GG, ML), pp. 98–112.
POPL-2005-BornatCOP - Permission accounting in separation logic (RB, CC, PWO, MJP), pp. 259–270.
POPL-2005-CalcagnoGZ - Context logic and tree update (CC, PG, UZ), pp. 271–282.
POPL-2005-ParkinsonB #abstraction- Separation logic and abstraction (MJP, GMB), pp. 247–258.
PPDP-2005-Mitchell #analysis #network #protocol #security- Security analysis of network protocols: logical and computational methods (JCM), pp. 151–152.
ASE-2005-Tan #embedded #modelling #self #source code #specification- Model-based self-monitoring embedded programs with temporal logic specifications (LT), pp. 380–383.
ESEC-FSE-2005-LetierKMU #modelling- Fluent temporal logic for discrete-time event-based models (EL, JK, JM, SU), pp. 70–79.
CASE-2005-AbdelhameedD #debugging #network #programmable #source code- Diagnosis and debugging of programmable logic controller control programs by neural networks (MMA, HD), pp. 313–318.
DAC-2005-AbdollahiP #canonical #performance #synthesis #verification- A new canonical form for fast boolean matching in logic synthesis and verification (AA, MP), pp. 379–384.
DAC-2005-AhmadM - TCAM enabled on-chip logic minimization (SA, RNM), pp. 678–683.
DAC-2005-MitraKSZ #challenge #design #fault- Logic soft errors in sub-65nm technologies design and CAD challenges (SM, TK, NS, MZ), pp. 2–4.
DAC-2005-NepalBMPZ #design #probability- Designing logic circuits for probabilistic computation in the presence of noise (KN, RIB, JLM, WRP, AZ), pp. 485–490.
DAC-2005-SasaoM #composition #functional #multi #representation- BDD representation for incompletely specifiedvmultiple-output logic functions and its applications to functional decomposition (TS, MM), pp. 373–378.
DAC-2005-TomL #clustering #design #scalability- Logic block clustering of large designs for channel-width constrained FPGAs (MT, GGL), pp. 726–731.
DATE-2005-BeckBKPLP #design #generative #implementation #quality- Logic Design for On-Chip Test Clock Generation — Implementation Details and Impact on Delay Test Quality (MB, OB, MK, FP, XL, RP), pp. 56–61.
DATE-2005-CheonLWWHCPCW - At-Speed Logic BIST for IP Cores (BC, EL, LTW, XW, PH, JC, JP, HC, SW), pp. 860–861.
DATE-2005-HuotDFR #architecture #multi- FPGA Architecture for Multi-Style Asynchronous Logic (NH, HD, LF, MR), pp. 32–33.
DATE-2005-KastensmidtSCR #composition #design #on the- On the Optimal Design of Triple Modular Redundancy Logic for SRAM-based FPGAs (FLK, LS, LC, MSR), pp. 1290–1295.
DATE-2005-MarkovM #encryption #hardware- Uniformly-Switching Logic for Cryptographic Hardware (ILM, DM), pp. 432–433.
DATE-2005-MukhopadhyayBR #analysis #modelling- Modeling and Analysis of Loading Effect in Leakage of Nano-Scaled Bulk-CMOS Logic Circuits (SM, SB, KR), pp. 224–229.
DATE-2005-TiriV #constant #design #difference #power management- Design Method for Constant Power Consumption of Differential Logic Circuits (KT, IV), pp. 628–633.
DATE-2005-YangHSP #multi #quantum #synthesis #using- Exact Synthesis of 3-Qubit Quantum Circuits from Non-Binary Quantum Gates Using Multiple-Valued Logic and Group Theory (GY, WNNH, XS, MAP), pp. 434–435.
LCTES-2005-FarcasFPT #component #execution #realtime- Transparent distribution of real-time components based on logical execution time (EF, CF, WP, JT), pp. 31–39.
WRLA-2004-CervesatoS05 #dependent type #representation #specification- Representing the MSR Cryptoprotocol Specification Language in an Extension of Rewriting Logic with Dependent Types (IC, MOS), pp. 183–207.
ESOP-2005-BieringBT #higher-order- BI Hyperdoctrines and Higher-Order Separation Logic (BB, LB, NTS), pp. 233–247.
ESOP-2005-ReusS #semantics- Denotational Semantics for Abadi and Leino’s Logic of Objects (BR, JS), pp. 263–278.
FASE-2005-Mostowski #formal method #java #security #verification- Formalisation and Verification of Java Card Security Properties in Dynamic Logic (WM), pp. 357–371.
FoSSaCS-2005-BonsangueK - Duality for Logics of Transition Systems (MMB, AK), pp. 455–469.
FoSSaCS-2005-CalcagnoGH #first-order- From Separation Logic to First-Order Logic (CC, PG, MH), pp. 395–409.
FoSSaCS-2005-Cheney #proving- A Simpler Proof Theory for Nominal Logic (JC), pp. 379–394.
FoSSaCS-2005-Schroder #algebra- Expressivity of Coalgebraic Modal Logic: The Limits and Beyond (LS), pp. 440–454.
TACAS-2005-BozzanoBCJRSS #incremental #linear #satisfiability- An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic (MB, RB, AC, TAJ, PvR, SS, RS), pp. 317–333.
TACAS-2005-KuglerHPLB #specification- Temporal Logic for Scenario-Based Specifications (HK, DH, AP, YL, YB), pp. 445–460.
TACAS-2005-SharmaPC #bound- Bounded Validity Checking of Interval Duration Logic (BS, PKP, SC), pp. 301–316.
CADE-2005-CastelliniS #first-order #proving #theorem proving- Proof Planning for First-Order Temporal Logic (CC, AS), pp. 235–249.
CADE-2005-ChaudhuriP #first-order #linear #proving #theorem proving- A Focusing Inverse Method Theorem Prover for First-Order Linear Logic (KC, FP), pp. 69–83.
CADE-2005-ContejeanC #first-order #proving #similarity- Reflecting Proofs in First-Order Logic with Equality (EC, PC), pp. 7–22.
CADE-2005-KonevWZ #transitive- Temporal Logics over Transitive States (BK, FW, MZ), pp. 182–203.
CADE-2005-Lev-AmiIRSSY #data type #first-order #linked data #open data #reachability #simulation #using #verification- Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures (TLA, NI, TWR, SS, SS, GY), pp. 99–115.
CAV-2005-MeirS #similarity- Yet Another Decision Procedure for Equality Logic (OM, OS), pp. 307–320.
CAV-2005-NieuwenhuisO #difference- DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic (RN, AO), pp. 321–334.
CSL-2005-Adamek #equation- A Logic of Coequations (JA), pp. 70–86.
CSL-2005-AndreoliPR - Permutative Logic (JMA, GP, PR), pp. 184–199.
CSL-2005-BradfieldK #complexity #fixpoint- The Complexity of Independence-Friendly Fixpoint Logic (JCB, SK), pp. 355–368.
CSL-2005-CateF #complexity #hybrid #on the- On the Complexity of Hybrid Logics with Binders (BtC, MF), pp. 339–354.
CSL-2005-ChaudhuriP #linear- Focusing the Inverse Method for Linear Logic (KC, FP), pp. 200–215.
CSL-2005-CourcelleD #composition #graph #higher-order #monad- The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic (BC, CD), pp. 325–338.
CSL-2005-Katsumata #metalanguage #semantics- A Semantic Formulation of TT-Lifting and Logical Predicates for Computational Metalanguage (SyK), pp. 87–102.
CSL-2005-Slissenko #algorithm #verification- Verification in Predicate Logic with Time: Algorithmic Questions (AS), pp. 3–17.
CSL-2005-VIICH #control flow #distributed- Distributed Control Flow with Classical Modal Logic (TMV, KC, RH), pp. 51–69.
ICLP-2005-Horrocks #named #ontology #owl- OWL: A Description Logic Based Ontology Language (IH), pp. 1–4.
ICLP-2005-Ray #horn clause #query- The Need for Ancestor Resolution When Answering Queries in Horn Clause Logic (OR), pp. 410–411.
ICLP-2005-Santos #concurrent #semantics #transaction #using- Denotational Semantics Using Horn Concurrent Transaction Logic (MVS), pp. 431–432.
LICS-2005-BarceloL - Temporal Logics over Unranked Trees (PB, LL), pp. 31–40.
LICS-2005-Benedikt - An Insider’s Guide to Logic in Telecommunications Data (MB), pp. 104–105.
LICS-2005-BonevaTT - Expressiveness of a Spatial Logic for Trees (IB, JMT, ST), pp. 280–289.
LICS-2005-Fontana #biology- Logic and Systems Biology (WF), p. 344.
LICS-2005-GodefroidH #model checking #semantics- Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics (PG, MH), pp. 158–167.
LICS-2005-HondaYB #higher-order #imperative- An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules (KH, NY, MB), pp. 270–279.
LICS-2005-KieronskiO #decidability #first-order- Small Substructures and Decidability Issues for First-Order Logic with Two Variables (EK, MO), pp. 448–457.
LICS-2005-Mellies #game studies #linear- Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic (PAM), pp. 386–395.
LICS-2005-OuaknineW #decidability #metric #on the- On the Decidability of Metric Temporal Logic (JO, JW), pp. 188–197.
SAT-2005-BelovS #satisfiability- Substitutional Definition of Satisfiability in Classical Propositional Logic (AB, ZS), pp. 31–45.
SAT-2005-LingSB #quantifier #satisfiability #synthesis #using- FPGA Logic Synthesis Using Quantified Boolean Satisfiability (ACL, DPS, SDB), pp. 444–450.
SAT-2005-SheiniS #integer #linear #satisfiability #scalability- A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic (HMS, KAS), pp. 241–256.
DRR-2004-HeDP #documentation- Hierarchical logical structure extraction of book documents by analyzing tables of contents (FH, XD, LP), pp. 6–13.
PODS-2004-CalvaneseGLR #integration #peer-to-peer- Logical Foundations of Peer-To-Peer Data Integration (DC, GDG, ML, RR), pp. 241–251.
SIGMOD-2004-PaparizosWLJ #evaluation #performance #xquery- Tree Logical Classes for Efficient Evaluation of XQuery (SP, YW, LVSL, HVJ), pp. 71–82.
VLDB-2004-DeutschPX #framework #xquery- The NEXT Logical Framework for XQuery (AD, YP, YX), pp. 168–179.
ITiCSE-2004-Waraich #education #using- Using narrative as a motivating device to teach binary arithmetic and logic gates (AW), pp. 97–101.
SIGITE-2004-Stanley #design #multi- Bringing bits, bytes, devices and computers to life with designs in multimedia logic (TDS), p. 267.
CIAA-2004-Lugiez #automaton #linear #set- From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P) (DL), pp. 321–322.
ICALP-2004-BrunsG #model checking #multi- Model Checking with Multi-valued Logics (GB, PG), pp. 281–293.
ICALP-2004-Hofmann #question #type system #what- What Do Program Logics and Type Systems Have in Common? (MH0), pp. 4–7.
ICALP-2004-Schweikardt #fixpoint #monad #on the #power of- On the Expressive Power of Monadic Least Fixed Point Logic (NS), pp. 1123–1135.
ICALP-2004-Toftdal #analysis #effectiveness #theorem- A Calibration of Ineffective Theorems of Analysis in a Hierarchy of Semi-classical Logical Principles: (MT), pp. 1188–1200.
IFM-2004-ChenL - Integrating Temporal Logics (YC, ZL), pp. 402–420.
IFM-2004-VilasARGD #imperative #incremental #modelling #semantics #specification- A Many-Valued Logic with Imperative Semantics for Incremental Specification of Timed Models (AFV, JJPA, RPDR, AGS, JGD), pp. 382–401.
SEFM-2004-ArbabBBR #component #modelling- Models and Temporal Logics for Timed Component Connectors (FA, CB, FSdB, JJMMR), pp. 198–207.
FLOPS-2004-HagiyaTYS #abstraction #analysis #automaton #using- Analysis of Synchronous and Asynchronous Cellular Automata Using Abstraction by Temporal Logic (MH, KT, MY, TS), pp. 7–21.
FLOPS-2004-Schurmann #framework #functional #programming- Twelf and Delphin: Logic and Functional Programming in a Meta-logical Framework (CS), pp. 22–23.
ICFP-2004-Honda #process- From process logic to program logic (KH), pp. 163–174.
ICFP-2004-TolmachAN #functional #implementation #multi #thread #using- Implementing functional logic languages using multiple threads and stores (APT, SA, MN), pp. 90–102.
IFL-2004-AntoyHLT #functional #virtual machine- A Virtual Machine for Functional Logic Computations (SA, MH, JL, APT), pp. 108–125.
ICGT-2004-Rensink #first-order #graph #representation #using- Representing First-Order Logic Using Graphs (AR), pp. 319–335.
EDOC-2004-BoerBJST #architecture- A Logical Viewpoint on Architectures (FSdB, MMB, JJ, AS, LWNvdT), pp. 73–83.
ICEIS-v3-2004-KazakovA #approach #automation #integration- Semi-Automated Software Integration: An Approach Based on Logical Inference (MK, HA), pp. 527–530.
ICPR-v2-2004-NoorRM #fuzzy #geometry- Global Geometry Extraction for Fuzzy Logic Based Handwritten Character (NMN, MR, PMC), pp. 513–516.
KR-2004-EiterLST #programming #semantics #set #web- Combining Answer Set Programming with Description Logics for the Semantic Web (TE, TL, RS, HT), pp. 141–151.
KR-2004-HustadtMS #datalog #source code- Reducing SHIQ-Description Logic to Disjunctive Datalog Programs (UH, BM, US), pp. 152–162.
KR-2004-LiuLL #reasoning- A Logic of Limited Belief for Reasoning with Disjunctive Information (YL, GL, HJL), pp. 587–597.
KR-2004-Lukasiewicz #probability- Weak Nonmonotonic Probabilistic Logics (TL), pp. 23–33.
KR-2004-MeyerFKZ - Logical Foundations of Negotiation: Strategies and Preferences (TAM, NYF, RK, DZ), pp. 311–318.
KR-2004-PacuitS - Majority Logic (EP, SS), pp. 598–605.
KR-2004-Shapiro - A Logic of Arbitrary and Indefinite Objects (SCS), pp. 565–575.
KR-2004-YamanNS - A Logic of Motion (FY, DSN, VSS), pp. 85–94.
SEKE-2004-WihartoS #using #xml- Future Proofing and Retargeting Application Logic Using O2XML (MW, PS), pp. 173–178.
AdaEurope-2004-HiltonH #ada #programmable- High-Integrity Interfacing to Programmable Logic with Ada (AJH, JGH), pp. 249–260.
LOPSTR-2004-Moody #locality- Logical Mobility and Locality Types (JM), pp. 69–84.
PADL-2004-BrasselCHH #functional- Observing Functional Logic Computations (BB, OC, MH, FH), pp. 193–208.
PDCL-2004-BasinDFHN #source code #synthesis- Synthesis of Programs in Computational Logic (DAB, YD, PF, AH, JFN), pp. 30–65.
PDCL-2004-LauO #composition #development #specification- Specifying Compositional Units for Correct Program Development in Computational Logic (KKL, MO), pp. 1–29.
POPL-2004-Dal-ZilioLM - A logic you can count on (SDZ, DL, CM), pp. 135–146.
PPDP-2004-HondaY #composition #higher-order #polymorphism- A compositional logic for polymorphic higher-order functions (KH, NY), pp. 191–202.
SAS-2004-AmtoftB #analysis #data flow- Information Flow Analysis in Logical Form (TA, AB), pp. 100–115.
SAS-2004-BozgaIL #alias #on the- On Logics of Aliasing (MB, RI, YL), pp. 344–360.
SAS-2004-KuncakR - Generalized Records and Spatial Conjunction in Role Logic (VK, MCR), pp. 361–376.
SAS-2004-Schmidt #approximate- Closed and Logical Relations for Over- and Under-Approximation of Powersets (DAS), pp. 22–37.
SAC-2004-El-Gayar #fuzzy #multi- Application of fuzzy logic to multiple criteria decision making in aquacultural planning (OFEG), pp. 1028–1029.
DAC-2004-CaoK #optimisation- Post-layout logic optimization of domino circuits (AC, CKK), pp. 820–825.
DAC-2004-DeleganesBGKSW #integer- Low voltage swing logic circuits for a Pentium 4 processor integer core (DJD, MB, GG, KK, APS, SW), pp. 678–680.
DAC-2004-DingM #novel- A novel technique to improve noise immunity of CMOS dynamic logic circuits (LD, PM), pp. 900–903.
DAC-2004-HrkicLB #approach #replication- An approach to placement-coupled logic replication (MH, JL, GB), pp. 711–716.
DAC-2004-HungSYYP #analysis #quantum #reachability #synthesis- Quantum logic synthesis by symbolic reachability analysis (WNNH, XS, GY, JY, MAP), pp. 838–841.
DAC-2004-KapoorJ #concurrent #specification #synthesis- Decomposing specifications with concurrent outputs to resolve state coding conflicts in asynchronous logic synthesis (HKK, MBJ), pp. 830–833.
DAC-2004-Kerntopf #algorithm #heuristic #synthesis- A new heuristic algorithm for reversible logic synthesis (PK), pp. 834–837.
DAC-2004-SasaoM #multi- A method to decompose multiple-output logic functions (TS, MM), pp. 428–433.
DATE-DF-2004-FerrerGFAC #implementation #named #network #programmable- NeuroFPGA — Implementing Artificial Neural Networks on Programmable Logic Devices (DF, RG, RF, JPA, RC), pp. 218–223.
DATE-v1-2004-KoorapatyKGFP - Exploring Logic Block Granularity for Regular Fabrics (AK, VK, PG, MF, LTP), pp. 468–473.
DATE-v1-2004-LyseckyV #architecture #clustering #configuration management #hardware- A Configurable Logic Architecture for Dynamic Hardware/Software Partitioning (RLL, FV), pp. 480–485.
DATE-v1-2004-PiguetGHOS #power management- Extremely Low-Power Logic (CP, JG, CH, IO, US), pp. 656–663.
DATE-v1-2004-TiriV #design #implementation- A Logic Level Design Methodology for a Secure DPA Resistant ASIC or FPGA Implementation (KT, IV), pp. 246–251.
DATE-v2-2004-AgrawalJ #synthesis- Synthesis of Reversible Logic (AA, NKJ), pp. 1384–1385.
DATE-v2-2004-LiuWH #synthesis- Crosstalk Minimization in Logic Synthesis for PLA (YYL, KHW, TH), pp. 790–795.
DATE-v2-2004-MondalCM #analysis #approach #using- A New Approach to Timing Analysis Using Event Propagation and Temporal Logic (AM, PPC, CAM), pp. 1198–1203.
DATE-v2-2004-ZhangGZJ #network #optimisation #synthesis- Synthesis and Optimization of Threshold Logic Networks with Application to Nanotechnologies (RZ, PG, LZ, NKJ), pp. 904–909.
DATE-2005-BernardiMQR04 #approach #testing #using- Testing Logic Cores using a BIST P1500 Compliant Approach: A Case of Study (PB, GM, FQ, MSR), pp. 228–233.
ESOP-2004-CacheraJPR #data flow- Extracting a Data Flow Analyser in Constructive Logic (DC, TPJ, DP, VR), pp. 385–400.
ESOP-2004-EspanaE #functional #semantics- A Memoizing Semantics for Functional Logic Languages (SE, VE), pp. 109–123.
ESOP-2004-Ghica #analysis #approach #semantics #specification- Semantical Analysis of Specification Logic, 3: An Operational Approach (DRG), pp. 264–278.
FoSSaCS-2004-Caires #behaviour #π-calculus- Behavioral and Spatial Observations in a Logic for the π-Calculus (LC), pp. 72–89.
FoSSaCS-2004-Leivant #correctness- Partial Correctness Assertions Provable in Dynamic Logics (DL), pp. 304–317.
TACAS-2004-AlurEM - A Temporal Logic of Nested Calls and Returns (RA, KE, PM), pp. 467–481.
TACAS-2004-BeauquierCP #automation #first-order #parametricity #protocol #state machine #verification- Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic (DB, TC, EP), pp. 372–387.
CAV-2004-GammieM #model checking #named- MCK: Model Checking the Logic of Knowledge (PG, RvdM), pp. 479–483.
CAV-2004-RepsSW #program analysis- Static Program Analysis via 3-Valued Logic (TWR, SS, RW), pp. 15–30.
CAV-2004-TalupurSSP - Range Allocation for Separation Logic (MT, NS, OS, AP), pp. 148–161.
CSL-2004-AvelloneFFM #calculus #implementation #performance- A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation (AA, CF, GF, UM), pp. 488–502.
CSL-2004-Ciabattoni #automation #calculus #generative- Automated Generation of Analytic Calculi for Logics with Linearity (AC), pp. 503–517.
CSL-2004-Gianantonio #linear #multi- Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity (PDG), pp. 130–144.
CSL-2004-Goubault-LarrecqLNZ #encryption #λ-calculus- Complete Lax Logical Relations for Cryptographic λ-Calculi (JGL, SL, DN, YZ), pp. 400–414.
CSL-2004-Hyvernat #linear- Predicate Transformers and Linear Logic: Yet Another Denotational Model (PH), pp. 115–129.
CSL-2004-ImmermanRRSY #bound #decidability #transitive- The Boundary Between Decidability and Undecidability for Transitive-Closure Logics (NI, AMR, TWR, SS, GY), pp. 160–174.
CSL-2004-MetcalfeOG - Goal-Directed Methods for Lukasiewicz Logic (GM, NO, DMG), pp. 85–99.
CSL-2004-Richerby - Logical Characterizations of PSPACE (DR), pp. 370–384.
CSL-2004-Schroder #similarity #λ-calculus- The Logic of the Partial λ-Calculus with Equality (LS), pp. 385–399.
CSL-2004-StrassburgerL #linear #multi #on the #proving- On Proof Nets for Multiplicative Linear Logic with Units (LS, FL), pp. 145–159.
CSL-2004-Weber #towards #verification- Towards Mechanized Program Verification with Separation Logic (TW), pp. 250–264.
IJCAR-2004-BaaderGT #decidability #problem #word- A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics (FB, SG, CT), pp. 183–197.
IJCAR-2004-Beeson - Lambda Logic (MB), pp. 460–474.
IJCAR-2004-Gottlob #finite #higher-order #research- Second-Order Logic over Finite Structures — Report on a Research Programme (GG), pp. 229–243.
IJCAR-2004-Larchey-Wendling - Counter-Model Search in Gödel-Dummett Logics (DLW), pp. 274–288.
IJCAR-2004-MeseguerR #analysis #formal method #semantics #specification #tool support- Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools (JM, GR), pp. 1–44.
LICS-2004-FuhrmannP #geometry #interactive #on the- On the Geometry of Interaction for Classical Logic (CF, DJP), pp. 211–220.
LICS-2004-GabbayC #calculus- A Sequent Calculus for Nominal Logic (MG, JC), pp. 139–148.
LICS-2004-GroheS #first-order #linear- The Succinctness of First-Order Logic on Linear Orders (MG, NS), pp. 438–447.
LICS-2004-Leivant #proving #termination- Proving Termination Assertions in Dynamic Logics (DL), pp. 89–98.
DRR-2003-LiangD #documentation- Content features for logical document labeling (JL, DSD), pp. 189–196.
ECDL-2003-NottelmannF #nondeterminism #probability- Combining DAML+OIL, XSLT, and Probabilistic Logics for Uncertain Schema Mappings in MIND (HN, NF), pp. 194–206.
ICDAR-2003-AllierDGME - Texture Feature Characterization for Logical Pre-labeling (BA, JD, AG, PM, HE), pp. 567–571.
CSMR-2003-ElishR #design #metric #object-oriented- Investigation of Metrics for Object-Oriented Design Logical Stability (MOE, DCR), pp. 193–200.
CSMR-2003-TourweM #identification #metaprogramming #refactoring #using- Identifying Refactoring Opportunities Using Logic Meta Programming (TT, TM), pp. 91–100.
CIAA-2003-Fritz #automaton #linear #simulation #using- Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata (CF), pp. 35–48.
ICALP-2003-AriolaH - Minimal Classical Logic and Control Operators (ZMA, HH), pp. 871–885.
ICALP-2003-KlaedtkeR #higher-order #monad- Monadic Second-Order Logics with Cardinalities (FK, HR), pp. 681–696.
ICALP-2003-Vardi #automaton- Logic and Automata: A Match Made in Heaven (MYV), pp. 64–65.
RTA-2003-BournezH - Rewriting Logic and Probabilities (OB, MH), pp. 61–75.
RTA-2003-Comon-LundhC #decidability #encryption #first-order #protocol- New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols (HCL, VC), pp. 148–164.
RTA-2003-Dal-ZilioL #automaton #xml- XML Schema, Tree Logic and Sheaves Automata (SDZ, DL), pp. 246–263.
RTA-2003-McAllester #algorithm #ml #type inference- Joint RTA-TLCA Invited Talk: A Logical Algorithm for ML Type Inference (DAM), pp. 436–451.
TLCA-2003-CoppolaR #type system- Principal Typing in Elementary Affine Logic (PC, SRDR), pp. 90–104.
TLCA-2003-CoquandPT #framework- A Logical Framework with Dependently Typed Records (TC, RP, MT), pp. 105–119.
TLCA-2003-Maurel #nondeterminism- Nondeterministic Light Logics and NP-Time (FM), pp. 241–255.
ICEIS-v2-2003-SolvangDS #flexibility #fuzzy #network- Applying Fuzzy Logic and Neural Network for Quantifying Flexibility of Supply Chains (WDS, ZD, BS), pp. 557–561.
ECIR-2003-LosadaB #documentation #evaluation #query #scalability- Propositional Logic Representations for Documents and Queries: A Large-Scale Evaluation (DEL, AB), pp. 219–234.
MLDM-2003-LazliS #fuzzy #probability #recognition #speech #using- Connectionist Probability Estimators in HMM Arabic Speech Recognition Using Fuzzy Logic (LL, MS), pp. 379–388.
SEKE-2003-BelliniGNR #c++ #implementation #realtime- TILCO Temporal Logic for Real-Time Systems Implementation in C++ (PB, AG, PN, DR), pp. 166–173.
UML-2003-StraetenMSJ #consistency #maintenance #modelling #uml #using- Using Description Logic to Maintain Consistency between UML Models (RVDS, TM, JS, VJ), pp. 326–340.
LOPSTR-2003-BiernackiD #interpreter- From Interpreter to Logic Engine by Defunctionalization (DB, OD), pp. 143–159.
LOPSTR-2003-LauO #object-oriented- Correct OO Systems in Computational Logic (KKL, MO), pp. 34–53.
PADL-2003-DellAcquaP #framework #modelling- A Logical Framework for Modelling eMAS (PD, LMP), pp. 241–255.
PADL-2003-FernandezHS #combinator #constraints #functional #problem- Solving Combinatorial Problems with a Constraint Functional Logic Language (AJF, MTHG, FSP), pp. 320–338.
PEPM-2003-BozgaIL #alias #semantics- Storeless semantics and alias logic (MB, RI, YL), pp. 55–65.
SAS-2003-BaldanKK #abstraction #graph transformation- A Logic for Analyzing Abstractions of Graph Transformation Systems (PB, BK, BK), pp. 255–272.
SIGAda-2003-EvangelistaKPR #ada #concurrent #linear #source code #verification- Verifying linear time temporal logic properties of concurrent Ada programs with quasar (SE, CK, JFPP, PR), pp. 17–24.
ASE-2003-AbergLSMM #aspect-oriented #automation #evolution #kernel #on the #using- On the automatic evolution of an OS kernel using temporal logic and AOP (RAÅ, JLL, MS, GM, AFLM), pp. 196–204.
DAC-2003-BeraudoL #optimisation #replication- Timing optimization of FPGA placements by logic replication (GB, JL), pp. 196–201.
DAC-2003-ChenHBW #analysis #automation #constraints- Automatic trace analysis for logic of constraints (XC, HH, FB, YW), pp. 460–465.
DAC-2003-JiangMB #evaluation- Generalized cofactoring for logic function evaluation (YJ, SM, RKB), pp. 155–158.
DAC-2003-LyseckyV - On-chip logic minimization (RLL, FV), pp. 334–337.
DAC-2003-MillerMD #algorithm #synthesis- A transformation based algorithm for reversible logic synthesis (DMM, DM, GWD), pp. 318–323.
DAC-2003-MukhopadhyayRR #estimation #modelling- Accurate estimation of total leakage current in scaled CMOS logic circuits based on compact current modeling (SM, AR, KR), pp. 169–174.
DAC-2003-SeshiaLB #hybrid #satisfiability- A hybrid SAT-based decision procedure for separation logic with uninterpreted functions (SAS, SKL, REB), pp. 425–430.
DAC-2003-WohlWPA #architecture #performance- Efficient compression and application of deterministic patterns in a logic BIST architecture (PW, JAW, SP, MBA), pp. 566–569.
DATE-2003-ChoiR - A New Crosstalk Noise Model for DOMINO Logic Circuits (SHC, KR), pp. 11112–11113.
DATE-2003-DingM #modelling- Modeling Noise Transfer Characteristic of Dynamic Logic Gates (LD, PM), pp. 11114–11117.
DATE-2003-FazelTR #design #named #visualisation- PLFire: A Visualization Tool for Asynchronous Phased Logic Designs (KF, MAT, RBR), pp. 11096–11097.
DATE-2003-GericotaASF #configuration management #runtime- Run-Time Management of Logic Resources on Reconfigurable Systems (MGG, GRA, MLS, JMF), pp. 10974–10979.
DATE-2003-KoorapatyCTPPS #architecture #programmable- Heterogeneous Programmable Logic Block Architectures (AK, VC, KYT, CP, LTP, HS), pp. 11118–11119.
DATE-2003-SirisantanaR #power management- Selectively Clocked CMOS Logic Style for Low-Power Noise-Immune Operations in Scaled Technologies (NS, KR), pp. 11160–11161.
ESOP-2003-RepsSL #difference #finite #static analysis- Finite Differencing of Logical Formulas for Static Analysis (TWR, SS, AL), pp. 380–398.
ESOP-2003-YahavRSW #evolution #verification- Verifying Temporal Heap Properties Specified via Evolution Logic (EY, TWR, SS, RW), pp. 204–222.
FASE-2003-AguirreM #component #configuration management #specification- A Logical Basis for the Specification of Reconfigurable Component-Based Systems (NA, TSEM), pp. 37–51.
FASE-2003-BeckertM #java #transaction- A Program Logic for Handling JAVA CARD’s Transaction Mechanism (BB, WM), pp. 246–260.
FASE-2003-MerzWZ #mobile #refinement #specification- A Spatio-Temporal Logic for the Specification and Refinement of Mobile Systems (SM, MW, JZ), pp. 87–101.
FASE-2003-SchroderM #hoare #independence- Monad-Independent Hoare Logic in HASCASL (LS, TM), pp. 261–277.
TACAS-2003-ArmoniBKV #linear- Resets vs. Aborts in Linear Temporal Logic (RA, DB, OK, MYV), pp. 65–80.
CADE-2003-CraryS #framework- Foundational Certified Code in a Metalogical Framework (KC, SS), pp. 106–120.
CADE-2003-HladikS #automaton- A Translation of Looping Alternating Automata into Description Logics (JH, US), pp. 90–105.
CADE-2003-LutzST #complexity #finite #reasoning- The Complexity of Finite Model Reasoning in Description Logics (CL, US, LT), pp. 60–74.
CADE-2003-MehtaN #higher-order #pointer #proving #source code- Proving Pointer Programs in Higher-Order Logic (FM, TN), pp. 121–135.
CAV-2003-ArmoniFFGPTV #detection #linear- Enhanced Vacuity Detection in Linear Temporal Logic (RA, LF, AF, OG, NP, AT, MYV), pp. 368–380.
CAV-2003-ChakravortyP - Digitizing Interval Duration Logic (GC, PKP), pp. 167–179.
CAV-2003-ChechikG #named #query- TLQSolver: A Temporal Logic Query Checker (MC, AG), pp. 210–214.
CAV-2003-EisnerFHLMC #reasoning- Reasoning with Temporal Logic on Truncated Paths (CE, DF, JH, YL, AM, DVC), pp. 27–39.
CAV-2003-Geilen #on the fly #realtime- An Improved On-The-Fly Tableau Construction for a Real-Time Temporal Logic (MG), pp. 394–406.
CSL-2003-Artemov - Back to the Future: Explicit Logic for Computer Science (SNA), p. 43.
CSL-2003-Brunnler - Atomic Cut Elimination for classical Logic (KB), pp. 86–97.
CSL-2003-Buchberger #symbolic computation- Computational Mathematics, Computational Logic, and Symbolic Computation (BB), pp. 98–99.
CSL-2003-DawarR #fixpoint #symmetry- A Fixed-Point Logic with Symmetric Choice (AD, DR), pp. 169–182.
CSL-2003-MetcalfeOG - Goal-Directed Calculli for Gödel-Dummett Logics (GM, NO, DMG), pp. 413–426.
CSL-2003-MeydenP #probability #quantum- A Logic for Probability in Quantum Systems (RvdM, MP), pp. 427–440.
CSL-2003-Reus #composition #semantics- Modular Semantics and Logics of Classes (BR), pp. 456–469.
CSL-2003-Vermeulen #first-order #semantics- More Computation Power for a Denotational Semantics for First Order Logic (KFMV), pp. 530–543.
CSL-2003-ZhangN - Logical Relations for Dynamic Name Creation (YZ, DN), pp. 575–588.
ICLP-2003-Morozov #development #logic programming #web- Development and Application of Logical Actors Mathematical Apparatus for Logic Programming of Web Agents (AAM), pp. 494–495.
LICS-2003-Abadi #data access- Logic in Access Control (MA), p. 228–?.
LICS-2003-Drimmelen #satisfiability- Satisfiability in Alternating-time Temporal Logic (GvD), pp. 208–217.
LICS-2003-HughesG #linear #multi #proving- Proof Nets for Unit-free Multiplicative-Additive Linear Logic (DJDH, RJvG), pp. 1–10.
LICS-2003-LaurentR #linear- About Translations of Classical Logic into Polarized Linear Logic (OL, LR), pp. 11–20.
LICS-2003-LibkinN #query- Logical Definability and Query Languages over Unranked Trees (LL, FN), pp. 178–187.
LICS-2003-McCarthy - Advice about logical AI (JM), p. 244–?.
VMCAI-2003-Majster-CederbaumZF #perspective #refinement- Action Refinement from a Logical Point of View (MEMC, NZ, HF), pp. 253–267.
VMCAI-2003-YangRS #encoding #mobile #model checking #process #using #π-calculus- A Logical Encoding of the pi-Calculus: Model Checking Mobile Processes Using Tabled Resolution (PY, CRR, SAS), pp. 116–131.
CBSE-2002-AguirreM #approach #component #reasoning #specification- A Temporal Logic Approach to Component–Based System Specification and Reasoning (NA, TM), p. 11.
VLDB-2002-ConradGJM #database #physics #using- Database Selection Using Actual Physical and Acquired Logical Collection Resources in a Massive Domain-specific Operational Environment (JGC, XSG, PJ, MM), pp. 71–82.
VLDB-2002-SenkulKT #constraints #framework #resource management #scheduling #workflow- A Logical Framework for Scheduling Workflows under Resource Allocation Constraints (PS, MK, IHT), pp. 694–705.
DLT-2002-Esik #finite #generative #monad #word- Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators (ZÉ), pp. 43–58.
ICALP-2002-AdsulS #linear- Complete and Tractable Local Linear Time Temporal Logics over Traces (BA, MAS), pp. 926–937.
ICALP-2002-CardelliGG #graph #query- A Spatial Logic for Querying Graphs (LC, PG, GG), pp. 597–610.
ICALP-2002-GastinM - An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces (PG, MM), pp. 938–949.
ICALP-2002-HearnD #constraints #nondeterminism #reduction- The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications (RAH, EDD), pp. 401–413.
FME-2002-OheimbN #hoare #revisited- Hoare Logic for NanoJava: Auxiliary Variables, Side Effects, and Virtual Methods Revisited (DvO, TN), pp. 89–105.
RTA-2002-Baader #representation- Engineering of Logics for the Content-Based Representation of Information (FB), p. 23.
RTA-2002-DeharbeMR #model checking- Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae (DD, AMM, CR), pp. 207–221.
FLOPS-2002-AntoyH #design pattern #functional- Functional Logic Design Patterns (SA, MH), pp. 67–87.
ICGT-2002-GyapayHV #graph transformation- Graph Transformation with Time: Causality and Logical Clocks (SG, RH, DV), pp. 120–134.
CAiSE-2002-AoumeurS #behaviour #diagrams #prototype #uml #using- Integrating and Rapid-Prototyping UML Structural and Behavioural Diagrams Using Rewriting Logic (NA, GS), pp. 296–310.
CAiSE-2002-Liu #xml- A Logical Foundation for XML (ML), pp. 568–583.
CAiSE-2002-VassiliadisSS #modelling #on the #process- On the Logical Modeling of ETL Processes (PV, AS, SS), pp. 782–786.
ICEIS-2002-AllouiCO #monitoring #process- Taming Process Deviations by Logic Based Monitoring (IA, SC, FO), pp. 716–724.
ICEIS-2002-MarirZO #database #online #retrieval #video- An Integrated Object Database and Description Logic System for Online Content and Event-Based Indexing and Retrieval of a Car Park Surveillance Video (FM, KZ, KO), pp. 129–139.
ICEIS-2002-OuziriV #approach #documentation #modelling #probability- Logic and Probabilistic Based Approach for Document Data Modeling (MO, CV), pp. 1126–1129.
CIKM-2002-Amer-YahiaFGS #physics #semistructured data- Logical and physical support for heterogeneous data (SAY, MFF, RG, DS), pp. 270–281.
ICPR-v3-2002-LiangDMG #classification- Page Classification through Logical Labelling (JL, DSD, MYM, JKG), pp. 477–480.
KR-2002-BernferhatDKP #framework #representation- Bipolar Representation and Fusion of Preferences on the Possibilistic Logic framework (SB, DD, SK, HP), pp. 421–448.
KR-2002-BrandtKT #approximate #difference- Approximation and Difference in Description Logics (SB, RK, AYT), pp. 203–214.
KR-2002-BrewkaBB - Qualitative Choice Logic (GB, SB, DLB), pp. 158–169.
KR-2002-Cate #on the- On the Logic of d-separation (BtC), pp. 568–577.
KR-2002-Darwiche #approach #network- A Logical Approach to Factoring Belief Networks (AD), pp. 409–420.
KR-2002-HustadtS #benchmark #metric- Scientific Benchmarking with Temporal Logic Decision Procedures (UH, RAS), pp. 533–546.
KR-2002-Lutz - Adding Numbers to the SHIQ Description Logic: First Results (CL), pp. 191–202.
KR-2002-Shanahan #feedback- A Logical Account of Perception Incorporating Feedback and Expectation (MS), pp. 3–13.
SEKE-2002-AugustoG #modelling #paradigm- A temporal logic view of paradigm models (JCA, RG), pp. 497–503.
SEKE-2002-Lascio #fuzzy- Hilbertian systems, analytic fuzzy tableaux and cut rule elimination in rational pavelka logic (LDL), pp. 117–124.
SPLC-2002-Mannion #first-order #product line #using #validation- Using First-Order Logic for Product Line Model Validation (MM), pp. 176–187.
LOPSTR-2002-BragaHMM #composition- Mapping Modular SOS to Rewriting Logic (CdOB, EHH, JM, PDM), pp. 262–277.
LOPSTR-2002-FioravantiPP #higher-order #logic programming #monad #program transformation #source code- Combining Logic Programs and Monadic Second Order Logics by Program Transformation (FF, AP, MP), pp. 160–181.
LOPSTR-2002-LauO #design #framework #object-oriented #towards- Towards Correct Object-Oriented Design Frameworks in Computational Logic (KKL, MO), pp. 260–261.
POPL-2002-LaceyJWF #compilation #correctness #optimisation #proving- Proving correctness of compiler optimizations by temporal logic (DL, NDJ, EVW, CCF), pp. 283–294.
POPL-2002-NeubauerTGS #functional- Functional logic overloading (MN, PT, MG, MS), pp. 233–244.
PPDP-2002-BozzanoD #automation #linear #protocol #verification- Automated protocol verification in linear logic (MB, GD), pp. 38–49.
SAS-2002-Reps #program analysis- Static Program Analysis via 3-Valued Logic (TWR), p. 1.
ASE-2002-AguirreM #approach #component #configuration management #specification- A Temporal Logic Approach to the Specification of Reconfigurable Component-Based Systems (NA, TSEM), pp. 271–274.
FSE-2002-GurfinkelDC #query- Model exploration with temporal logic query checking (AG, BD, MC), pp. 139–148.
FSE-2002-Holzmann #debugging- The logic of bugs (GJH), pp. 81–87.
ICSE-2002-Niere #design #fuzzy #interactive- Fuzzy logic based interactive recovery of software design (JN), pp. 727–728.
GPCE-2002-BrichauMV #composition #metaprogramming- Building Composable Aspect-Specific Languages with Logic Metaprogramming (JB, KM, KDV), pp. 110–127.
LDTA-2002-BrandMR #asf+sdf- The ELAN Environment: a Rewriting Logic Environment based on ASF+SDF Technology — System Demonstration (MvdB, PEM, CR), pp. 50–56.
DAC-2002-BernasconiCLP #performance #symmetry- Fast three-level logic minimization based on autosymmetry (AB, VC, FL, LP), pp. 425–430.
DAC-2002-EderB #performance #pipes and filters #verification- Achieving maximum performance: a method for the verification of interlocked pipeline control logic (KE, GB), pp. 135–140.
DAC-2002-JiangB #simulation #specification #synthesis #using- Software synthesis from synchronous specifications using logic simulation techniques (YJ, RKB), pp. 319–324.
DAC-2002-JungKK - Low-swing clock domino logic incorporating dual supply and dual threshold voltages (SOJ, KWK, SMK), pp. 467–472.
DAC-2002-MartelDAWA - Carbon nanotube field-effect transistors and logic circuits (RM, VD, JA, SJW, PA), pp. 94–98.
DATE-2002-JungKK #performance #synthesis- Dual Threshold Voltage Domino Logic Synthesis for High Performance with Noise and Power Constrain (SOJ, KWK, SMK), pp. 260–265.
DATE-2002-KapurWM - Directed-Binary Search in Logic BIST Diagnostics (RK, TWW, MRM), p. 1121.
DATE-2002-PandiniPS #synthesis- Congestion-Aware Logic Synthesis (DP, LTP, AJS), pp. 664–671.
DATE-2002-RezvaniP #concurrent- Concurrent and Selective Logic Extraction with Timing Consideration (PR, MP), p. 1086.
WRLA-J-1996-BorovanskyKKM02 #perspective- ELAN from a rewriting logic point of view (PB, CK, HK, PEM), pp. 155–185.
WRLA-J-1996-ClavelDELMMQ02 #maude #named #programming #specification- Maude: specification and programming in rewriting logic (MC, FD, SE, PL, NMO, JM, JFQ), pp. 187–243.
WRLA-J-1996-ClavelM02 - Reflection in conditional rewriting logic (MC, JM), pp. 245–288.
WRLA-J-1996-DiaconescuF02 - Logical foundations of CafeOBJ (RD, KF), pp. 289–318.
WRLA-J-1996-GadducciM02 #calculus- Comparing logics for rewriting: rewriting logic, action calculi and tile logic (FG, UM), pp. 319–358.
WRLA-J-1996-Marte-OlietM02 #overview #roadmap- Rewriting logic: roadmap and bibliography (NMO, JM), pp. 121–154.
WRLA-J-1996-OlveczkyM02 #hybrid #realtime #specification- Specification of real-time and hybrid systems in rewriting logic (PCÖ, JM), pp. 359–405.
WRLA-J-1996-Talcott02 - Actor theories in rewriting logic (CLT), pp. 441–485.
WRLA-J-1996-Viry02 #equation- Equational rules for rewriting logic (PV), pp. 487–517.
FoSSaCS-2002-Cirstea #algebra #on the #reachability #specification- On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability (CC), pp. 82–97.
FoSSaCS-2002-Kurz #semantics- Logics Admitting Final Semantics (AK), pp. 238–249.
FoSSaCS-2002-LangeS #fixpoint #model checking- Model Checking Fixed Point Logic with Chop (ML, CS), pp. 250–263.
TACAS-2002-ArmoniFFGGKLMSTVZ - The ForSpec Temporal Logic: A New Temporal Property-Specification Language (RA, LF, AF, RG, BG, TK, AL, SMH, ES, AT, MYV, YZ), pp. 296–211.
TACAS-2002-HongLSU #generative #test coverage- A Temporal Logic Based Theory of Test Coverage and Generation (HSH, IL, OS, HU), pp. 327–341.
WRLA-2002-BruniMM #transaction- Tiling Transactions in Rewriting Logic (RB, JM, UM), pp. 90–109.
WRLA-2002-ClavelMP #equation #similarity- Reflection in Membership Equational Logic, Many-Sorted Equational Logic, Horn Logic with Equality, and Rewriting Logic (MC, JM, MP), pp. 110–126.
WRLA-2002-EkerKLLT #biology #execution #modelling #network- Pathway Logic: Executable Models of Biological Networks (SE, MK, KL, PL, CLT), pp. 144–161.
CADE-2002-ArecesH #hybrid- HyLoRes 1.0: Direct Resolution for Hybrid Logics (CA, JH), pp. 156–160.
CADE-2002-BernardL - Temporal Logic for Proof-Carrying Code (AB, PL), pp. 31–46.
CADE-2002-Egly - Embedding Lax Logic into Intuitionistic Logic (UE), pp. 78–93.
CADE-2002-GalmicheM #proving- Connection-Based Proof Search in Propositional BI Logic (DG, DM), pp. 111–128.
CADE-2002-Horrocks #reasoning #theory and practice- Reasoning with Expressive Description Logics: Theory and Practice (IH), pp. 1–15.
CADE-2002-Hurd #first-order #interface- An LCF-Style Interface between HOL and First-Order Logic (JH), pp. 134–138.
CADE-2002-Larchey-Wendling - Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic (DLW), pp. 94–110.
CADE-2002-StumpD #framework #performance #proving- Faster Proof Checking in the Edinburgh Logical Framework (AS, DLD), pp. 392–407.
CAV-2002-BryantLS #modelling #using #verification- Modeling and Verifying Systems Using a Logic of Counter Arithmetic with λ Expressions and Uninterpreted Functions (REB, SKL, SAS), pp. 78–92.
CSL-2002-BeauquierRS #decidability #model checking #probability- A Logic of Probability with Decidable Model-Checking (DB, AMR, AS), pp. 306–321.
CSL-2002-ChernovSSV - Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle (AVC, DPS, EZS, NKV), pp. 74–88.
CSL-2002-GeuversJ #interactive #proving- Open Proofs and Open Terms: A Basis for Interactive Logic (HG, GIJ), pp. 537–552.
CSL-2002-Goubault-LarrecqLN #monad- Logical Relations for Monadic Types (JGL, SL, DN), pp. 553–568.
CSL-2002-Hasegawa #linear- Classical Linear Logic of Implications (MH), pp. 458–472.
CSL-2002-Kreutzer #fixpoint #infinity- Partial Fixed-Point Logic on Infinite Structures (SK), pp. 337–351.
CSL-2002-KuceraS #ltl- The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL (AK, JS), pp. 276–291.
CSL-2002-MoshierJ #semantics- A Logic for Probabilities in Semantics (MAM, AJ), pp. 216–231.
CSL-2002-Neven #automaton #xml- Automata, Logic, and XML (FN), pp. 2–26.
CSL-2002-Nipkow #bound #hoare #nondeterminism #recursion- Hoare Logics for Recursive Procedures and Unbounded Nondeterminism (TN), pp. 103–119.
ICLP-2002-Bruscoli #proving- A Purely Logical Account of Sequentiality in Proof Search (PB), pp. 302–316.
ICLP-2002-Christiansen #constraints- Logical Grammars Based on Constraint Handling Rules (HC), p. 481.
ICLP-2002-Decker #challenge #database #semantics #web- Logic Databases on the Semantic Web: Challenges and Opportunities (SD), pp. 20–21.
ICLP-2002-GanzingerM #algorithm- Logical Algorithms (HG, DAM), pp. 209–223.
ICLP-2002-MartinNSS #learning #prolog- Learning in Logic with RichProlog (EM, PMN, AS, FS), pp. 239–254.
ICLP-2002-OsorioNA #approach #debugging #prolog- Debugging in A-Prolog: A Logical Approach (MO, JANP, JA), pp. 482–483.
ICLP-2002-Schimpf - Logical Loops (JS), pp. 224–238.
LICS-2002-Bars #satisfiability- The 0-1 law fails for frame satisfiability of propositional modal logic (JMLB), pp. 225–234.
LICS-2002-BenediktL #algebra #automaton #query- Tree Extension Algebras: Logics, Automata, and Query Languages (MB, LL), p. 203–?.
LICS-2002-CalvaneseGL #information management #representation- Description Logics: Foundations for Class-based Knowledge Representation (DC, GDG, ML), pp. 359–370.
LICS-2002-FrickG #complexity #first-order #higher-order #monad #revisited- The Complexity of First-Order and Monadic Second-Order Logic Revisited (MF, MG), pp. 215–224.
LICS-2002-HirschkoffLS #decidability- Separability, Expressiveness, and Decidability in the Ambient Logic (DH, ÉL, DS), pp. 423–432.
LICS-2002-HodkinsonWZ #branch #decidability #first-order- Decidable and Undecidable Fragments of First-Order Branching Temporal Logics (IMH, FW, MZ), pp. 393–402.
LICS-2002-Kreutzer #equivalence #fixpoint- Expressive Equivalence of Least and Inflationary Fixed-Point Logic (SK), p. 403–?.
LICS-2002-LaroussinieMS - Temporal Logic with Forgettable Past (FL, NM, PS), pp. 383–392.
LICS-2002-ReusS #calculus #semantics- Semantics and Logic of Object Calculi (BR, TS), p. 113–?.
LICS-2002-Reynolds #data type- Separation Logic: A Logic for Shared Mutable Data Structures (JCR), pp. 55–74.
SAT-2002-Clarke #abstraction #model checking #refinement #satisfiability- SAT based abstraction refinement in temporal logic model checking (EC), p. 26.
SAT-2002-MalerMNA #difference #satisfiability- A satisfiability checker for difference logic (OM, MM, PN, EA), p. 27.
SAT-2002-Pretolani #modelling #probability- Probabilistic logic: The PSAT and CPA models (DP), p. 30.
ICDAR-2001-Anjewierden #documentation #incremental #named- AIDAS: Incremental Logical Structure Discovery in PDF Documents (AA), pp. 374–378.
ICDAR-2001-MalerbaELA #automation #component #comprehension #dependence #documentation #image- Automated Discovery of Dependencies Between Logical Components in Document Image Understanding (DM, FE, FAL, OA), pp. 174–178.
ICDAR-2001-Souafi-BensafiPLE #network #using- Logical Labeling Using Bayesien Networks (SSB, MP, FL, HE), pp. 832–836.
PODS-2001-GottlobLS #game studies- Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width (GG, NL, FS).
ITiCSE-2001-AbrahamCLMY - The logic tutor (DA, LC, LL, AM, KY), p. 184.
IWPC-2001-Sneed #cobol #source code- Extracting Business Logic from Existing COBOL Programs as a Basis for Redevelopment (HMS), pp. 167–175.
DLT-2001-EiterGS #higher-order #string- Second-Order Logic over Strings: Regular and Non-regular Fragments (TE, GG, TS), pp. 37–56.
FME-2001-CalderMS - An Adequate Logic for Full LOTOS (MC, SM, CS), pp. 384–395.
FME-2001-ChechikEP #model checking #multi- Model-Checking over Multi-valued Logics (MC, SME, VP), pp. 72–98.
FME-2001-Paynter #realtime #revisited- Real-Time Logic Revisited (SP), pp. 300–317.
TLCA-2001-CardelliG #strict- Logical Properties of Name Restriction (LC, ADG), pp. 46–60.
TLCA-2001-CoppolaM #constraints #linear #type system- Typing λ Terms in Elementary Logic with Linear Constraints (PC, SM), pp. 76–90.
TLCA-2001-Haghverdi #category theory #linear #modelling- Partially Additive Categories and Fully Complete Models of Linear Logic (EH), pp. 197–216.
FLOPS-2001-PolakovY #exception #framework #order #proving- Proving Syntactic Properties of Exceptions in an Ordered Logical Framework (JP, KY), pp. 61–77.
ICEIS-v1-2001-CarvalhoRMNK #fuzzy #quantifier #using- Quantification of the Emotional Quotient of the Intelligence using the Classic and Fuzzy Logic (LFdC, RR, RRdM, SMN, CK), pp. 361–365.
ICEIS-v2-2001-HikitaM #first-order #modelling #ontology #process- Business Process Modeling Based on the Ontology and First-Order Logic (TH, MJM), pp. 717–723.
SEKE-2001-IosifS #java- Temporal Logic Properties of Java Objects (RI, RS), pp. 120–127.
AdaEurope-2001-Amey - Logic versus Magic in Critical Systems (PA), pp. 49–67.
LOPSTR-2001-FerrariFO #bound #proving- Extracting Exact Time Bounds from Logical Proofs (MF, CF, MO), pp. 245–266.
LOPSTR-2001-FerreR #framework- A Framework for Developing Embeddable Customized Logics (SF, OR), pp. 191–215.
LOPSTR-2001-LauO #object-oriented- Correct Object-Oriented Systems in Computational Logic (KKL, MO), pp. 168–190.
PADL-2001-BaldoniBCP #programming #using #web- Programming Goal-Driven Web Sites Using an Agent Logic Language (MB, CB, AC, VP), pp. 60–75.
PLDI-2001-MollerS #pointer- The Pointer Assertion Logic Engine (AM, MIS), pp. 221–231.
POPL-2001-Sangiorgi - Extensionality and Intensionality of the Ambient Logics (DS), pp. 4–13.
POPL-2001-Yahav #concurrent #java #safety #source code #using #verification- Verifying safety properties of concurrent Java programs using 3-valued logic (EY), pp. 27–40.
RE-2001-SmithHE #constraints #editing #requirements #source code #visual notation- Events and Constraints: A Graphical Editor for Capturing Logic Requirements of Programs (MHS, GJH, KE), pp. 14–22.
SAC-2001-Chainbi - A belief-goal-role logic for a single-agent system (WC), pp. 22–26.
LDTA-2001-Noll #erlang #implementation- A Rewriting Logic Implementation of Erlang (TN), pp. 206–224.
DAC-2001-ChangWM #using- Layout-Driven Hot-Carrier Degradation Minimization Using Logic Restructuring Techniques (CWJC, KW, MMS), pp. 97–102.
DAC-2001-Ciriani #using- Logic Minimization using Exclusive OR Gates (VC), pp. 115–120.
DAC-2001-KarandikarS - Technology Mapping for SOI Domino Logic Incorporating Solutions for the Parasitic Bipolar Effect (SKK, SSS), pp. 377–382.
DAC-2001-KimCL #estimation- A Static Estimation Technique of Power Sensitivity in Logic Circuits (TK, KSC, CLL), pp. 215–219.
DAC-2001-LiebmannLHG #design- Enabling Alternating Phase Shifted Mask Designs for a Full Logic Gate Level: Design Rules and Design Rule Checking (LL, JL, FLH, IG), pp. 79–84.
DAC-2001-MishchenkoSP #algorithm- An Algorithm for Bi-Decomposition of Logic Functions (AM, BS, MAP), pp. 103–108.
DAC-2001-OzgunerMDWSH #design #education #verification- Teaching Future Verification Engineers: The Forgotten Side of Logic Design (FÖ, DWM, JD, BW, JS, LH), pp. 253–255.
DATE-2001-CheungWC #clustering #using- Further improve circuit partitioning using GBAW logic perturbation techniques (CCC, YLW, DIC), pp. 233–239.
DATE-2001-DorschW #embedded #testing #using- Using mission logic for embedded testing (RD, HJW), p. 805.
DATE-2001-EspejoEMO #optimisation #reasoning- Generalized reasoning scheme for redundancy addition and removal logic optimization (JAE, LE, ESM, EO), pp. 391–397.
DATE-2001-HeringLM #functional #named #parallel- dibSIM: a parallel functional logic simulator allowing dynamic load balancing (KH, JL, JM), pp. 472–478.
DATE-2001-IrionKVW #clustering #performance #synthesis- Circuit partitioning for efficient logic BIST synthesis (AI, GK, HPEV, HJW), pp. 86–91.
DATE-2001-Ruiz-de-ClavijoJBAV #named- HALOTIS: high accuracy LOgic TIming simulator with inertial and degradation delay model (PRdC, JJC, MJB, AJA, MV), pp. 467–471.
ESOP-2001-CardelliG #query- A Query Language Based on the Ambient Logic (LC, GG), pp. 1–22.
FASE-2001-JacobsP #java #ml #modelling- A Logic for the Java Modeling Language JML (BJ, EP), pp. 284–299.
FASE-2001-Selic #physics #programming- Physical Programming: Beyond Mere Logic (BS), p. 1.
FoSSaCS-2001-CalcagnoO #on the- On Garbage and Program Logic (CC, PWO), pp. 137–151.
TACAS-2001-ChocklerKV #metric #model checking- Coverage Metrics for Temporal Logic Model Checking (HC, OK, MYV), pp. 528–542.
CAV-2001-BeerBEFGR - The Temporal Logic Sugar (IB, SBD, CE, DF, AG, YR), pp. 363–367.
CAV-2001-MoondanosSHK #divide and conquer #equivalence #named #verification- CLEVER: Divide and Conquer Combinational Logic Equivalence VERification with False Negative Elimination (JM, CJHS, ZH, DK), pp. 131–143.
CAV-2001-RodehS #equivalence #finite- Finite Instantiations in Equivalence Logic with Uninterpreted Functions (YR, OS), pp. 144–154.
CAV-2001-VelevB #named #similarity- EVC: A Validity Checker for the Logic of Equality with Uninterpreted Functions and Memories, Exploiting Positive Equality, and Conservative Transformations (MNV, REB), pp. 235–240.
CSL-2001-Akama #algebra #combinator #towards #λ-calculus- Limiting Partial Combinatory Algebras towards Infinitary λ-Calculi and Classical Logic (YA), pp. 399–413.
CSL-2001-AlechinaMPR #category theory #semantics- Categorical and Kripke Semantics for Constructive S4 Modal Logic (NA, MM, VdP, ER), pp. 292–307.
CSL-2001-BoerE #decidability #navigation- Decidable Navigation Logics for Object Structures (FSdB, RMvE), pp. 324–338.
CSL-2001-DawarGK #fixpoint- Inflationary Fixed Points in Modal Logic (AD, EG, SK), pp. 277–291.
CSL-2001-Girard - Locus Solum: From the Rules of Logic to the Logic of Rules (JYG), p. 38.
CSL-2001-Kanovich #linear #monad #power of- The Expressive Power of Horn Monadic Linear Logic (MIK), pp. 39–53.
CSL-2001-Koriche #approximate #first-order #reasoning- A Logic for Approximate First-Order Reasoning (FK), pp. 262–276.
CSL-2001-LutzSW - Modal Logic and the Two-Variable Fragment (CL, US, FW), pp. 247–261.
CSL-2001-Mogbil #commutative #correctness #polynomial- Quadratic Correctness Criterion for Non-commutative Logic (VM), pp. 69–83.
CSL-2001-Rasmussen #deduction- Labelled Natural Deduction for Interval Logics (TMR), pp. 308–323.
CSL-2001-RoccaR - Intersection Logic (SRDR, LR), pp. 414–428.
CSL-2001-StarkN #state machine- A Logic for Abstract State Machines (RFS, SN), pp. 217–231.
ICLP-2001-Almendros-JimenezBS #database #deduction #functional- A Computational Model for Functional Logic Deductive Databases (JMAJ, ABT, JSH), pp. 331–347.
ICLP-2001-Kowalski #question- Is Logic Really Dead or Only Just Sleeping? (RAK), pp. 2–3.
ICLP-2001-MedinaOV #abduction #approach #multi #reasoning- A Multi-adjoint Logic Approach to Abductive Reasoning (JM, MOA, PV), pp. 269–283.
IJCAR-2001-BeckertS #calculus #first-order- A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities (BB, SS), pp. 626–641.
IJCAR-2001-CerritoM #quantifier- Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation (SC, MCM), pp. 137–151.
IJCAR-2001-CerroFGHLM #proving- Lotrec : The Generic Tableau Prover for Modal and Description Logics (LFdC, DF, OG, AH, DL, FM), pp. 453–458.
IJCAR-2001-HaarslevMT #modelling #pseudo #reasoning- Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics (VH, RM, AYT), pp. 61–75.
IJCAR-2001-HaarslevMW #approach #motivation- The Description Logic ALCNHR+ Extended with Concrete Domains: A Practically Motivated Approach (VH, RM, MW), pp. 29–44.
IJCAR-2001-HodasT #agile #first-order #implementation #linear #named #proving #theorem proving- lolliCop — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic (JSH, NT), pp. 670–684.
IJCAR-2001-Lutz - NEXPTIME-Complete Description Logics with Concrete Domains (CL), pp. 45–60.
IJCAR-2001-LutzSWZ #constant- Tableaux for Temporal Description Logic with Constant Domains (CL, HS, FW, MZ), pp. 121–136.
LICS-2001-Avigad #first-order- Eliminating Definitions and Skolem Functions in First-Order Logic (JA), pp. 139–146.
LICS-2001-BrunsG #query- Temporal Logic Query Checking (GB, PG), pp. 409–417.
LICS-2001-HuuskonenH #on the #order- On Definability of Order in Logic with Choice (TH, TH), pp. 167–172.
LICS-2001-KozenT #correctness #linear- Intuitionistic Linear Logic and Partial Correctness (DK, JT), pp. 259–268.
LICS-2001-LangeS #game studies #satisfiability- Focus Games for Satisfiability and Completeness of Temporal Logic (ML, CS), pp. 357–365.
LICS-2001-Thomas #challenge- The Engineering Challenge for Logic (WT), pp. 173–176.
SAT-2001-BejarCFMG #satisfiability- Extending the Reach of SAT with Many-Valued Logics (RB, AC, CF, FM, CPG), pp. 392–407.
HT-2000-LiKVT #web- Defining logical domains in a web site (WSL, OK, QV, HT), pp. 123–132.
PODS-2000-GeertsK #approximate #database #linear #transitive #using- Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic (FG, BK), pp. 126–135.
SIGMOD-2000-Lomet #online #using- High Speed On-line Backup When Using Logical Log Operations (DBL), pp. 34–45.
ICALP-2000-BaierHHK #on the- On the Logical Characterisation of Performability Properties (CB, BRH, HH, JPK), pp. 780–792.
ICALP-2000-Kuske #infinity- Infinite Series-Parallel Posets: Logic and Languages (DK), pp. 648–662.
ICALP-2000-LugiezS #decidability #first-order- Decidable First-Order Transition Logics for PA-Processes (DL, PS), pp. 342–353.
ICALP-2000-Moszkowski #proving- An Automata-Theoretic Completeness Proof for Interval Temporal Logic (BCM), pp. 223–234.
ICALP-2000-PlotkinPST - Lax Logical Relations (GDP, JP, DS, RDT), pp. 85–102.
RTA-2000-Meseguer #concept #maude- Rewriting Logic and Maude: Concepts and Applications (JM), pp. 1–26.
CAiSE-2000-ChiuLK #exception #framework #workflow- A Logical Framework for Exception Handling in ADOME Workflow Management System (DKWC, QL, KK), pp. 110–125.
ICEIS-2000-Barker #approach #security- Information Security: A Logic Based Approach (SB), pp. 9–14.
ICEIS-2000-NeiraABG #adaptation #fuzzy #on the #testing- On Adaptive Testing with Fuzzy Logic (ÁN, AA, JALB, VGG), pp. 186–190.
ICPR-v2-2000-BhanuBT #feature model #image- Logical Templates for Feature Extraction in Fingerprint Images (BB, MB, XT), pp. 2846–2850.
ICPR-v4-2000-MatsumotoOHT #3d #fuzzy #image #testing- Three-Dimensional Image Construction for Non-Destructive Testing Aided by Fuzzy Logic (TM, KO, YH, KT), pp. 4603–4606.
ICPR-v4-2000-ThaibaouiRB #approach #detection #fuzzy #image- A Fuzzy Logic Approach to Drusen Detection in Retinal Angiographic Images (AT, AR, PB), pp. 4748–4751.
KR-2000-AmirM #reasoning- Partition-Based Logical Reasoning (EA, SAM), pp. 389–400.
KR-2000-DeneckerMT #semantics- Uniform semantic treatment of default and autoepistemic logic (MD, VWM, MT), pp. 74–84.
KR-2000-FargierLM - Propositional Logic and One-Stage Decision Making (HF, JL, PM), pp. 445–456.
KR-2000-IocchiNR #concurrent #framework #implementation- Planning with sensing, concurrency, and exogenous events: logical framework and implementation (LI, DN, RR), pp. 678–689.
KR-2000-Jamil #inheritance #parametricity- A Logic Based Language for Parametric Inheritance (HMJ), pp. 611–622.
KR-2000-LafageL #representation- Logical representation of preferences for group decision making (CL, JL), pp. 457–468.
KR-2000-MontanariPS #automation #deduction #first-order- Supporting automated deduction in first-order modal logics (AM, AP, MS), pp. 547–556.
KR-2000-Yelland #network- An Alternative Combination of Bayesian Networks and Description Logics (PMY), pp. 225–234.
LOPSTR-J-2000-AlbertAV #effectiveness #functional #partial evaluation- Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages (EA, SA, GV), pp. 103–124.
PEPM-2000-Pfenning #on the #staged- On the Logical Foundations of Staged Computation (FP), p. 33.
POPL-2000-CardelliG #mobile- Anytime, Anywhere: Modal Logics for Mobile Ambients (LC, ADG), pp. 365–377.
PPDP-2000-CalcagnoIO #alias #analysis #hoare #pointer #semantics- Semantic analysis of pointer aliasing, allocation and disposal in Hoare logic351292 (CC, SSI, PWO), pp. 190–201.
PPDP-2000-Fages #concurrent #constraints #linear #programming- Concurrent constraint programming and linear logic (FF), p. 44.
PPDP-2000-Panangaden #probability #process- From logic to stochastic processes (PP), pp. 1–2.
PPDP-2000-PowerR #abstraction- Logical relations, data abstraction, and structured fibrations (JP, ER), pp. 15–23.
SAS-2000-Jackson #constraints #design- Enforcing Design Constraints with Object Logic (DJ), pp. 1–21.
FSE-2000-Jackson #automation #first-order #relational- Automating first-order relational logic (DJ), pp. 130–139.
ICSE-2000-Dong #composition #design #framework- A logical framework for design composition (JD), pp. 698–700.
SAC-2000-Wainer #coordination #process #representation- Logic Representation of Processes in Work Activity Coordination (JW), pp. 203–209.
DAC-2000-AttarhaNL #fault #fuzzy #modelling #simulation #using- Modeling and simulation of real defects using fuzzy logic (AA, MN, CL), pp. 631–636.
DAC-2000-KimNK #synthesis- Domino logic synthesis minimizing crosstalk (KWK, UN, SMK), pp. 280–285.
DAC-2000-YangCS #named #optimisation- BDS: a BDD-based logic optimization system (CY, MJC, VS), pp. 92–97.
DATE-2000-CiricYS #implementation #using- Delay Minimization and Technology Mapping of Two-Level Structures and Implementation Using Clock-Delayed Domino Logic (JC, GY, CS), pp. 277–282.
DATE-2000-GulrajaniH #identification #multi- Multi-Node Static Logic Implications for Redundancy Identification (KG, MSH), pp. 729–733.
DATE-2000-KumthekarS #optimisation #reduction- Power and Delay Reduction via Simultaneous Logic and Placement Optimization in FPGAs (BK, FS), pp. 202–207.
DATE-2000-LuW #memory management #modelling- Cost and Benefit Models for Logic and Memory BIST (JML, CWW), pp. 710–714.
DATE-2000-Maurer #network #simulation #state machine #using- Logic Simulation Using Networks of State Machines (PMM), pp. 674–678.
DATE-2000-SchollB #generative #multi #on the- On the Generation of Multiplexer Circuits for Pass Transistor Logic (CS, BB), pp. 372–378.
DATE-2000-YangC #synthesis- Synthesis for Mixed CMOS/PTl Logic (CY, MJC), p. 750.
ESOP-2000-DenneyJ #correctness #java- Correctness of Java Card Method Lookup via Logical Relations (ED, TPJ), pp. 104–118.
FASE-2000-HuismanJ #hoare #java #termination #verification- Java Program Verification via a Hoare Logic with Abrupt Termination (MH, BJ), pp. 284–303.
FoSSaCS-2000-Schubert #first-order #type inference- Type Inference for First-Order Logic (AS), pp. 297–313.
FoSSaCS-2000-Treinen #automaton #testing- Predicate Logic and Tree Automata with Tests (RT), pp. 329–343.
FoSSaCS-2000-Tsay #composition #linear #verification- Compositional Verification in Linear-Time Temporal Logic (YKT), pp. 344–358.
TACAS-2000-BenerecettiG #model checking #protocol #security #using- Model Checking Security Protocols Using a Logic of Belief (MB, FG), pp. 519–534.
WRLA-2000-Hilberdink - New Foundations for Rewriting Logic (HH), pp. 43–69.
WRLA-2000-KulasB #prolog #standard- Defining Standard Prolog in Rewriting Logic (MK, CB), pp. 158–174.
WRLA-2000-LeuckerN #framework #tool support #verification- Rewriting Logic as a Framework for Generic Verification Tools (ML, TN), pp. 121–137.
WRLA-2000-Pattinson - Modal Logic for Rewriting Theories (DP), pp. 175–193.
CADE-2000-AllenCEKL - The Nuprl Open Logical Environment (SFA, RLC, RE, CK, LL), pp. 170–176.
CADE-2000-AndrewsB #education #higher-order #named #proving #theorem proving #tutorial #using- Tutorial: Using TPS for Higher-Order Theorem Proving and ETPS for Teaching Logic (PBA, CEB), pp. 511–512.
CADE-2000-HorrocksST #reasoning- Reasoning with Individuals for the Description Logic SHIQ (IH, US, ST), pp. 482–496.
CADE-2000-MichaelA #bytecode #higher-order #semantics #syntax- Machine Instruction Syntax and Semantics in Higher Order Logic (NGM, AWA), pp. 7–24.
CADE-2000-SchmidtH - A Resolution Decision Procedure for Fluted Logic (RAS, UH), pp. 433–448.
CADE-2000-Schurmann #framework #named #tutorial- Tutorial: Meta-logical Frameworks (CS), pp. 507–508.
CAV-2000-AyariB #bound #higher-order #monad- Bounded Model Construction for Monadic Second-Order Logics (AA, DAB), pp. 99–112.
CL-2000-Apt #first-order #semantics- A Denotational Semantics for First-Order Logic (KRA), pp. 53–69.
CL-2000-BonchiGP #database #on the #verification- On Verification in Logic Database Languages (FB, FG, DP), pp. 957–971.
CL-2000-BroersenWM #semantics- A Semantics for Persistency in Propositional Dynamic Logic (JMB, RW, JJCM), pp. 912–925.
CL-2000-Denecker #induction- Extending Classical Logic with Inductive Definitions (MD), pp. 703–717.
CL-2000-GartnerSTDP - Psychiatric Diagnosis from the Viewpoint of Computational Logic (JG, TS, AT, CVD, LMP), pp. 1362–1376.
CL-2000-HarlandLW #multi #proving- Goal-Directed Proof Search in Multiple-Conclusions Intuitionistic Logic (JH, TL, MW), pp. 254–268.
CL-2000-KhizderTW #reasoning- Reasoning about Duplicate Elimination with Description Logic (VLK, DT, GEW), pp. 1017–1032.
CL-2000-Maher #semantics- A Denotational Semantics of Defeasible Logic (MJM), pp. 209–222.
CL-2000-MukhopadhyayP #model checking #process- Model Checking for Timed Logic Processes (SM, AP), pp. 598–612.
CL-2000-Pallotta #composition #logic programming #semantics #source code- A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs (VP), pp. 777–791.
CL-2000-Poole #information management #representation- Logic, Knowledge Representation, and Bayesian Decision Theory (DP), pp. 70–86.
CL-2000-Robinson #challenge- Computational Logic: Memories of the Past and Challenges for the Future (JAR), pp. 1–24.
CL-2000-YangK #implementation #named #performance #using- FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine (GY, MK), pp. 1078–1093.
CSL-2000-BaazZ #fuzzy #proving- Hypersequent and the Proof Theory of Intuitionistic Fuzzy Logic (MB, RZ), pp. 187–201.
CSL-2000-Bradfield #concurrent #independence #named- Independence: Logics and Concurrency (JCB), pp. 247–261.
CSL-2000-Kuznets #complexity #on the- On the Complexity of Explicit Modal Logics (RK), pp. 371–383.
CSL-2000-Momigliano #framework- Elimination of Negation in a Logical Framework (AM), pp. 411–426.
CSL-2000-MurawskiO #game studies- Discreet Games, Light Affine Logic and PTIME Computation (ASM, CHLO), pp. 427–441.
CSL-2000-PowerR #abstraction- Logical Relations and Data Abstraction (JP, ER), pp. 497–511.
CSL-2000-Shelah - Choiceless Polynominal Time Logic: Inability to Express (SS), pp. 72–125.
CSL-2000-Vardi #automation #automaton #graph #verification- Automated Verification = Graphs, Automata, and Logic (MYV), p. 139.
CSL-2000-Yavorsky #on the #proving #standard- On the Logic of the Standard Proof Predicate (REY), pp. 527–541.
LICS-2000-Fagin #complexity #game studies- Logic, Complexity, and Games (RF), p. 3.
LICS-2000-GradelHO - Back and Forth between Guarded and Modal Logics (EG, CH, MO), pp. 217–228.
LICS-2000-LemstromH #approximate #pattern matching #transitive- Approximate Pattern Matching is Expressible in Transitive Closure Logic (KL, LH), pp. 157–167.
LICS-2000-Moszkowski #axiom #infinity- A Complete Axiomatization of Interval Temporal Logic with Infinite Time (BCM), pp. 241–252.
LICS-2000-Voronkov #calculus #how #proving- How to Optimize Proof-Search in Modal Logics: A New Way of Proving Redundancy Criteria for Sequent Calculi (AV), pp. 401–412.
ECDL-1999-VelegrakisCC #declarative #specification #using- Declarative Specification of Z39.50 Wrappers Using Description Logics (YV, VC, PC), pp. 383–402.
ICDAR-1999-Ishitani #analysis #documentation #image- Logical Structure Analysis of Document Images based on Emergent Computation (YI), pp. 189–192.
ICDAR-1999-YamaokaIBK #approach #documentation #image #interactive #using- Interactive Approach to the Extraction of Logical Structures from Unformatted Document Images Using a Sub-structure Model (MY, OI, NB, TK), pp. 185–188.
SIGMOD-1999-LometT - Logical Logging to Extend Recovery to New Domains (DBL, MRT), pp. 73–84.
ITiCSE-1999-Power #design #diagrams #named- Designer — a logic diagram design tool (CP), p. 211.
DLT-1999-KlarlundDS #constraints #named #parsing- Yakyak: parsing with logical side constraints (NK, ND, MIS), pp. 286–301.
ICALP-1999-AlurTEP #parametricity- Parametric Temporal Logic for “Model Measuring” (RA, KE, SLT, DP), pp. 159–168.
ICALP-1999-EngelfrietH #finite #higher-order #monad #transducer- Two-Way Finite State Transducers and Monadic Second-Order Logic (JE, HJH), pp. 311–320.
ICALP-1999-HirshfeldR #decidability #framework- A Framework for Decidable Metrical Logics (YH, AMR), pp. 422–432.
ICALP-1999-Szegedy #artificial reality #proving- Many-Valued Logics and Holographic Proofs (MS), pp. 676–686.
FM-v1-1999-Couvreur #linear #on the fly #verification- On-the-Fly Verification of Linear Temporal Logic (JMC), pp. 253–271.
FM-v2-1999-KellomakiM #design- Archived Design Steps in Temporal Logic (PK, TM), p. 1858.
FM-v2-1999-Martin #first-order- Relating Z and First-Order Logic (AM), pp. 1266–1280.
RTA-1999-Courcelle #graph- Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas (BC), pp. 90–91.
RTA-1999-DowekHK #first-order #higher-order #named- HOL-λσ: An Intentional First-Order Expression of Higher-Order Logic (GD, TH, CK), pp. 317–331.
TLCA-1999-Abrusci - Modules in Non-communicative Logic (VMA), pp. 14–24.
TLCA-1999-FioreS - λ Definability with Sums via Grothendieck Logical Relations (MPF, AKS), pp. 147–161.
TLCA-1999-Goguen #framework #semantics- Soundness of the Logical Framework for Its Typed Operational Semantics (HG), pp. 177–197.
TLCA-1999-Hasegawa #linear- Logical Predicates for Intuitionistic Linear Type Theories (MH), pp. 198–212.
TLCA-1999-PolakowP #deduction #linear- Natural Deduction for Intuitionistic Non-communicative Linear Logic (JP, FP), pp. 295–309.
TLCA-1999-PollZ #data type- A Logic for Abstract Data Types as Existential Types (EP, JZ), pp. 310–324.
TLCA-1999-UrbanB #normalisation- Strong Normalisation of Cut-Elimination in Classical Logic (CU, GMB), pp. 365–380.
FLOPS-1999-HanusL #functional #program analysis #semantics- A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages (MH, SL), pp. 353–368.
FLOPS-1999-Lux #encapsulation #functional #implementation #lazy evaluation- Implementing Encapsulated Search for a Lazy Functional Logic Language (WL), pp. 100–113.
FLOPS-1999-Ohori #automaton #morphism- The Logical Abstract Machine: A Curry-Howard Isomorphism for Machine Code (AO), pp. 300–318.
HCI-EI-1999-VienneJJ #adaptation #fuzzy #interface #using- Use of Fuzzy Logic in an Adaptive Interface meant for Teleoperation (FV, AMJD, DJ), pp. 306–310.
ICEIS-1999-AlvesHM #database #development #named- DB-GRAPH — A Tool for Development of Database Systems Based on the Extended Entity Relationship Logical Model (MAA, MOH, FLM), pp. 3–6.
LOPSTR-1999-FilipeLOY #aspect-oriented #component #development #framework #object-oriented #on the- On Dynamic Aspects of OOD Frameworks in Component-Based Software Development in Computational Logic (JKF, KKL, MO, HY), pp. 42–61.
POPL-1999-SagivRW #analysis #parametricity- Parametric Shape Analysis via 3-Valued Logic (SS, TWR, RW), pp. 105–118.
PPDP-1999-Pfenning #framework- Logical and Meta-Logical Frameworks (FP), p. 206.
ASE-1999-FuchsST #first-order #natural language- Controlled Natural Language Can Replace First-Order Logic (NEF, US, ST), pp. 295–298.
SAC-1999-ChiuH #design- GA Design of Crisp-Fuzzy Logic Controllers (KSC, AH), pp. 238–242.
SAC-1999-CiampoliniLMS #abduction #coordination- Abductive Coordination for Logic Agents (AC, EL, PM, CS), pp. 134–140.
SAC-1999-GollaL #architecture #functional #parallel #scheduling #thread- A Dynamic Scheduling Logic for Exploiting Multiple Functional Units in Single Ship Multithreaded Architectures (PNG, ECL), pp. 466–473.
DAC-1999-Bening #simulation- A Two-State Methodology for RTL Logic Simulation (LB), pp. 672–677.
DAC-1999-Bergamaschi #behaviour #graph #network #synthesis- Behavioral Network Graph: Unifying the Domains of High-Level and Logic Synthesis (RAB), pp. 213–218.
DATE-1999-KimKHL #power management #synthesis- Logic Transformation for Low Power Synthesis (KWK, SMK, TH, CLL), pp. 158–162.
DATE-1999-MillanEECC #optimisation- Integrating Symbolic Techniques in ATPG-Based Sequential Logic Optimization (ESM, LE, JAE, SC, FC), pp. 516–520.
DATE-1999-Montiel-NelsonNASN #design #using- High Speed GaAs Subsystem Design using Feed Through Logic (JAMN, SN, VdA, RS, AN), p. 509–?.
DATE-1999-RenovellPFZ #configuration management #interface #testing- Testing the Configurable Interconnect/Logic Interface of SRAM-Based FPGA’s (MR, JMP, JF, YZ), pp. 618–622.
HPCA-1999-InoueKM #memory management- Dynamically Variable Line-Size Cache Exploiting High On-Chip Memory Bandwidth of Merged DRAM/Logic LSIs (KI, KK, KM), pp. 218–222.
OSDI-1999-HutchinsonMFHHKO #file system #physics- Logical vs. Physical File System Backup (NCH, SM, MF, GH, DH, SK, SWO), pp. 239–249.
PDP-1999-Dalton #hybrid #simulation- A special purpose hybrid SIMD processor for logic event simulation (DD), pp. 74–83.
ESOP-1999-BenediktRS #data type #decidability #linked data #open data- A Decidable Logic for Describing Linked Data Structures (MB, TWR, SS), pp. 2–19.
ESOP-1999-Poetzsch-HeffterM #java #programming- A Programming Logic for Sequential Java (APH, PM), pp. 162–176.
FoSSaCS-1999-AcetoI #recursion #testing- Testing Hennessy-Milner Logic with Recursion (LA, AI), pp. 41–55.
FoSSaCS-1999-HuhnNW #communication #model checking- Model Checking Logics for Communicating Sequential Agents (MH, PN, FW), pp. 227–242.
FoSSaCS-1999-Lenisa #bisimulation #equivalence #induction- A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects (ML), pp. 243–257.
FoSSaCS-1999-NarasimhaCI #calculus #probability #μ-calculus- Probabilistic Temporal Logics via the Modal μ-Calculus (MN, RC, SPI), pp. 288–305.
STOC-1999-Valiant #robust- Robust Logics (LGV), pp. 642–651.
CADE-1999-ArecesNR - Prefixed Resolution: A Resolution Method for Modal and Description Logics (CA, HdN, MdR), pp. 187–201.
CADE-1999-AutexierHMS - System Description: inka 5.0 — A Logic Voyager (SA, DH, HM, AS), pp. 207–211.
CADE-1999-DemriG #first-order- Tractable Transformations from Modal Provability Logics into First-Order Logic (SD, RG), pp. 16–30.
CADE-1999-Gradel - Invited Talk: Decision procedures for guarded logics (EG), pp. 31–51.
CADE-1999-KonradW #first-order #generative- System Description: Kimba, A Model Generator for Many-Valued First-Order Logics (KK, DAW), pp. 282–286.
CADE-1999-Lopes #automation #generative #higher-order #proving- Automatic Generation of Proof Search Strategies for Second-order Logic (RHCL), pp. 414–428.
CADE-1999-PfenningS #deduction #framework- System Description: Twelf — A Meta-Logical Framework for Deductive Systems (FP, CS), pp. 202–206.
CADE-1999-Tobies #algorithm- A PSpace Algorithm for Graded Modal Logic (ST), pp. 52–66.
CADE-1999-Weidenbach #analysis #automation #first-order #protocol #security #towards- Towards an Automatic Analysis of Security Protocols in First-Order Logic (CW), pp. 314–328.
CAV-1999-BloemRS #linear #model checking #performance- Efficient Decision Procedures for Model Checking of Linear Time Logic Properties (RB, KR, FS), pp. 222–235.
CAV-1999-BrunsG #model checking- Model Checking Partial State Spaces with 3-Valued Temporal Logics (GB, PG), pp. 274–287.
CAV-1999-BryantGV #similarity- Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions (REB, SMG, MNV), pp. 470–482.
CAV-1999-DanieleGV #automaton #generative #linear- Improved Automata Generation for Linear Temporal Logic (MD, FG, MYV), pp. 249–260.
CAV-1999-Etessami #automaton #invariant- Stutter-Invariant Languages, ω-Automata, and Temporal Logic (KE), pp. 236–248.
CAV-1999-Klarlund #automaton #formal method #strict- A Theory of Restrictions for Logics and Automata (NK), pp. 406–417.
CSL-1999-ArecesBM #complexity #hybrid- A Road-Map on Complexity for Hybrid Logics (CA, PB, MM), pp. 307–321.
CSL-1999-BalatC #linear #morphism- A Linear Logical View of Linear Type Isomorphisms (VB, RDC), pp. 250–265.
CSL-1999-DiekertG - An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces (VD, PG), pp. 188–203.
CSL-1999-HagiharaY - Resolution Method for Modal Logic with Well-Founded Frames (SH, NY), pp. 277–291.
CSL-1999-HirshfeldR - Quantitative Temporal Logic (YH, AMR), pp. 172–187.
CSL-1999-KuceraE #algebra- A Logical Viewpoint on Process-Algebraic Quotients (AK, JE), pp. 499–514.
CSL-1999-Mosses #semantics #specification- Logical Specification of Operational Semantics (PDM), pp. 32–49.
CSL-1999-Rasmussen - Signed Interval Logic (TMR), pp. 157–171.
CSL-1999-Roversi #proving- A P-Time Completeness Proof for Light Logics (LR), pp. 469–483.
CSL-1999-Tobies #strict- A NExpTime-Complete Description Logic Strictly Contained in C2 (ST), pp. 292–306.
ICLP-1999-HirataY #concurrent #declarative- Declarative Priority in a Concurrent Logic Language ON (KH, KY), pp. 215–229.
ICLP-1999-KaneiwaT #order- Event, Property, and Hierarchy in Order-Sorted Logic (KK, ST), pp. 94–108.
ICLP-1999-Thalheim #database #modelling- Logics and Database Modelling (BT), pp. 6–21.
LICS-1999-AtseriasK #finite #first-order #fixpoint #set- First-Order Logic vs. Fixed-Point Logic in Finite Set Theory (AA, PGK), pp. 275–284.
LICS-1999-BaziramwaboMT #composition- Modular Temporal Logic (AB, PM, DT), pp. 344–351.
LICS-1999-DevarajanHPP #linear #multi- Full Completeness of the Multiplicative Linear Logic of Chu Spaces (HD, DJDH, GDP, VRP), pp. 234–243.
LICS-1999-GradelW #fixpoint- Guarded Fixed Point Logic (EG, IW), pp. 45–54.
LICS-1999-HellaLNW - Logics with Aggregate Operators (LH, LL, JN, LW), pp. 35–44.
LICS-1999-Kozen #algebra #hoare #on the #testing- On Hoare Logic and Kleene Algebra with Tests (DK), pp. 167–172.
LICS-1999-Libkin #bound #invariant #query- Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries (LL), pp. 316–325.
LICS-1999-Pym #on the- On Bunched Predicate Logic (DJP), pp. 183–192.
ADL-1998-ShahS #modelling- Logical Information Modeling of Web-Accessible Heterogeneous Digital Assets (KS, APS), pp. 266–275.
HT-1998-BullockG #hypermedia #named #semantics- TourisT: The Application of a Description Logic Based Semantic Hypermedia System for Tourism (JCB, CAG), pp. 132–141.
PODS-1998-DavulcuKRR #analysis #modelling #workflow- Logic Based Modeling and Analysis of Workflows (HD, MK, CRR, IVR), pp. 25–33.
ICSM-1998-GallHJ #detection- Detection of Logical Coupling Based on Product Release History (HG, KH, MJ), pp. 190–197.
ICALP-1998-KestenPR #algorithm #linear #specification #verification- Algorithmic Verification of Linear Temporal Logic Specifications (YK, AP, LoR), pp. 1–16.
ICALP-1998-Pitts #equivalence- Existential Types: Logical Relations and Operational Equivalence (AMP), pp. 309–326.
RTA-1998-MullerN #constraints #higher-order #monad- Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic (MM, JN), pp. 196–210.
FLOPS-1998-Miyoshi - Rewriting Logic for Cyclic Sharing Structures (HM), pp. 167–186.
TAGT-1998-GadducciHK - A Fully Abstract Model for Graph-Interpreted Temporal Logic (FG, RH, MK), pp. 310–322.
ICPR-1998-RiazanovSZ #algebra #optimisation #pattern matching #pattern recognition #recognition- Mathematical methods for pattern recognition: logic, optimization, algebraic approaches (VVR, OVS, YIZ), pp. 831–834.
ICPR-1998-SattarT #approach #documentation #fuzzy #image #multi #on the #using- On the multiresolution enhancement of document images using fuzzy logic approach (FS, DBHT), pp. 939–941.
KR-1998-BuccafurriLR #order #semantics- Disjunctive Ordered Logic: Semantics and Expressiveness (FB, NL, PR), pp. 418–431.
KR-1998-CalvaneseGLNR #framework #integration- Description Logic Framework for Information Integration (DC, GDG, ML, DN, RR), pp. 2–13.
KR-1998-GiunchigliaGST #evaluation- More Evaluation of Decision Procedures for Modal Logics (EG, FG, RS, AT), pp. 626–635.
KR-1998-HaarslevLM #reasoning- Foundations of Spatioterminological Reasoning with Description Logics (VH, CL, RM), pp. 112–123.
KR-1998-Horrocks #question #using- Using an Expressive Description Logic: FaCT or Fiction? (IH), pp. 636–649.
KR-1998-KoniecznyP #on the- On the Logic of Merging (SK, RPP), pp. 488–498.
KR-1998-LakemeyerL #named- AOL: A logic of Acting, Sensing, Knowing, and Only Knowing (GL, HJL), pp. 316–329.
KR-1998-LangM #complexity #independence- Complexity Results for Independence and Definability in Propositional Logic (JL, PM), pp. 356–367.
KR-1998-Lenzerini - Description Logics and their Applications (ML), p. 652.
KR-1998-Lifschitz #calculus- Situation Calculus and Causal Logic (VL), pp. 536–546.
KR-1998-Sandewall #behaviour #modelling- Logic Based Modelling of Goal-Directed Behavior (ES), pp. 304–315.
KR-1998-WolterZ #decidability #on the- On the Decidability of Description Logics with Modal Operators (FW, MZ), pp. 512–523.
OOPSLA-1998-Rossie - Logical Observable Entities (JGRJ), pp. 154–165.
ALP-PLILP-1998-Arenas-SanchezLR #constraints #functional #lazy evaluation #multi- Embedding Multiset Constraints into a Lazy Functional Logic Language (PAS, FJLF, MRA), pp. 429–444.
ALP-PLILP-1998-CodishS #analysis #set- The Boolean Logic of Set Sharing Analysis (MC, HS), pp. 89–101.
LOPSTR-1998-BellotR #imperative #source code #synthesis- Logical Synthesis of Imperative O. O. Programs (PB, BR), pp. 316–318.
LOPSTR-1998-FuchsSS #specification- Attempto Controlled English — Not Just Another Logic Specification Language (NEF, US, RS), pp. 1–20.
LOPSTR-1998-LauO #component #development #framework #object-oriented- OOD Frameworks in Component-Based Software — Development in Computational Logic (KKL, MO), pp. 101–123.
SAC-1998-BenedicentiSVV #fuzzy #modelling #object-oriented #process- Object oriented process modeling with fuzzy logic (LB, GS, TV, AV), pp. 267–271.
SAC-1998-DuruDA #fuzzy #reduction #speech- Fuzzy logic based noise reduction of digitally recorded speech signal (ND, TD, NA), pp. 287–291.
SAC-1998-KarakasK #adaptation #fuzzy #using- Adaptive control of Bolu highway tunnel ventilation system using fuzzy logic (EK, HK), pp. 282–286.
SAC-1998-Nola #algebra #aspect-oriented #fuzzy- Algebraic aspects of fuzzy logic (AdN), pp. 255–261.
CC-1998-NielsonN #analysis #constraints- Flow Logics for Constraint Based Analysis (HRN, FN), pp. 109–127.
DAC-1998-BauerBKV #configuration management #performance #simulation- A Reconfigurable Logic Machine for Fast Event-Driven Simulation (JB, MB, IK, PV), pp. 668–671.
DAC-1998-KorupoluLW #independence- Exact Tree-based FPGA Technology Mapping for Logic Blocks with Independent LUTs (MRK, KKL, DFW), pp. 708–711.
DAC-1998-KravetsS #multi #named #synthesis- M32: A Constructive multilevel Logic Synthesis System (VNK, KAS), pp. 336–341.
DAC-1998-KwakP #estimation #fault #statistics- An Optimization-Based Error Calculation for Statistical Power Estimation of CMOS Logic Circuits (BK, ESP), pp. 690–693.
DATE-1998-LagoJLSB #fuzzy #named #synthesis- XFVHDL: A Tool for the Synthesis of Fuzzy Logic Controllers (EL, CJJ, DRL, SSS, ABB), pp. 102–107.
DATE-1998-Neely #configuration management- Reconfigurable Logic for Systems on a Chip (WSN), p. 340.
DATE-1998-PomeranzR #flexibility #synthesis- A Synthesis Procedure for Flexible Logic Functions (IP, SMR), pp. 973–974.
DATE-1998-RenovellPFZ #approach #configuration management- RAM-Based FPGA’s: A Test Approach for the Configurable Logic (MR, JMP, JF, YZ), pp. 82–88.
DATE-1998-RuttenBEK #algorithm #divide and conquer #performance- An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization (JWJMR, MRCMB, CAJvE, MAJK), pp. 749–754.
DATE-1998-SawadaYN #detection- Restructuring Logic Representations with Easily Detectable Simple Disjunctive Decompositions (HS, SY, AN), pp. 755–759.
DATE-1998-SchmerlerTM #simulation- Advanced Optimistic Approaches in Logic Simulation (SS, YT, KDMG), pp. 362–368.
PDP-1998-DjemameB #parallel #simulation- Parallel simulation in rewriting logic: some observations (KD, MB), pp. 197–203.
ESOP-1998-CairesM #concurrent #execution #specification- Verifiable and Executable Logic Specifications of Concurrent Objects in Lpi (LC, LM), pp. 42–56.
ESOP-1998-HenselHJT #modelling #object-oriented #tool support- Reasonong about Classess in Object-Oriented Languages: Logical Models and Tools (UH, MH, BJ, HT), pp. 105–121.
ESOP-1998-Leino #object-oriented #recursion #source code- Recursive Object Types in a Logic of Object-Oriented Programs (KRML), pp. 170–184.
TACAS-1998-AjamiHI #linear #model checking #symmetry- Exploiting Symmetry in Linear Time Temporal Logic Model Checking: One Step Beyond (KA, SH, JMI), pp. 52–67.
WRLA-1998-Bruni #composition #concurrent- A logic for modular descriptions of asynchronous and synchronized concurrent systems (RB), pp. 161–172.
WRLA-1998-CarabettaDG #semantics- CCS semantics via proved transition systems and rewriting logic (GC, PD, FG), pp. 369–387.
WRLA-1998-Clavel #maude- Reflection in general logics, rewriting logic, and Maude (MC), pp. 71–82.
WRLA-1998-Denker - From rewrite theories to temporal logic theories (GD), pp. 105–126.
WRLA-1998-Jouannaud #calculus #equation #induction- Membership equational logic, calculus of inductive instructions, and rewrite logic (JPJ), pp. 388–393.
WRLA-1998-MeseguerT - Mapping OMRS to rewriting logic (JM, CLT), pp. 33–54.
WRLA-1998-Mosses #composition #semantics- Semantics, modularity, and rewriting logic (PDM), pp. 404–421.
WRLA-1998-Schorlemmer - Rewriting logic as a logic of special relations (WMS), pp. 196–217.
WRLA-1998-StegglesK #case study #protocol #semantics- A timed rewriting logic semantics for SDL: A case study of alternating bit protocol (LJS, PK), pp. 83–104.
CADE-1998-Pfenning #deduction #linear #reasoning- Reasoning About Deductions in Linear Logic (FP), pp. 1–2.
CADE-1998-RichardsonSG #higher-order #proving #theorem proving- System Description: Proof Planning in Higher-Order Logic with Lambda-Clam (JR, AS, IG), pp. 129–133.
CADE-1998-SchurmannP #automation #proving #theorem proving- Automated Theorem Proving in a Simple Meta-Logic for LF (CS, FP), pp. 286–300.
CAV-1998-XuCSCM #first-order #graph #model checking #multi #using- Model Checking for a First-Order Temporal Logic Using Multiway Decision Graphs (YX, EC, XS, FC, OAM), pp. 219–231.
CSL-1998-Altenkirch #induction- Logical Relations and Inductive/Coinductive Types (TA), pp. 343–354.
CSL-1998-BaazV #fuzzy #quantifier- Quantifier Elimination in Fuzzy Logic (MB, HV), pp. 399–414.
CSL-1998-GiannottiMNP #database #effectiveness #nondeterminism #on the #semantics- On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases (FG, GM, MN, DP), pp. 58–72.
CSL-1998-Hajek #fuzzy #theorem- Trakhtenbrot Theorem and Fuzzy Logic (PH), pp. 1–8.
CSL-1998-Hoang - Choice Construct and Lindström Logics (HKH), pp. 105–125.
CSL-1998-Lukasiewicz #first-order #probability #semantics- Many-Valued First-Order Logics with Probabilistic Semantics (TL), pp. 415–429.
IWTCS-1998-DietrichLKH #distributed #testing- Testing Temporal Logic Properties in Distributed Systems (FD, XL, SK, JPH), pp. 247–258.
JICSLP-1998-AntoniouBM #normalisation- Normal Forms for Defeasible Logic (GA, DB, MJM), pp. 160–174.
JICSLP-1998-Gupta - Horn Logic Denotations (GG), pp. 357–358.
LICS-1998-ArieliA - The Logical Role of the Four-Valued Bilattice (OA, AA), pp. 118–126.
LICS-1998-Asperti - Light Affine Logic (AA), pp. 300–308.
LICS-1998-Bars #higher-order- Fragments of Existential Second-Order Logic without 0-1 Laws (JMLB), pp. 525–536.
LICS-1998-Benthem #process- Process Operations in Extended Dynamic Logics (JvB), pp. 244–250.
LICS-1998-DesharnaisEP #bisimulation #markov #process- A Logical Characterization of Bisimulation for Labeled Markov Processes (JD, AE, PP), pp. 478–487.
LICS-1998-EiterGG #higher-order #string- Existential Second-Order Logic over Strings (TE, GG, YG), pp. 16–27.
LICS-1998-Grohe #fixpoint #graph- Fixed-Point Logics on Planar Graphs (MG), pp. 6–15.
LICS-1998-KolaitisO #bound #first-order #on the #problem- On the Boundedness Problem for Two-Variable First-Order Logic (PGK, MO), pp. 513–524.
LICS-1998-Libkin #on the- On Counting Logics and Local Properties (LL), pp. 501–512.
LICS-1998-Mackie #linear- Linear Logic With Boxes (IM), pp. 309–320.
LICS-1998-Needham - Logic and Over-Simplification (RMN), pp. 2–3.
LICS-1998-Thomas #automaton #monad- Monadic Logic and Automata: Recent Developments (WT), pp. 136–138.
ICDAR-1997-LinNN #analysis #documentation #image #using- Logical Structure Analysis of Book Document Images Using Contents Information (CL, YN, SN), pp. 1048–1054.
ICDAR-1997-ParmentierB #recognition- Logical Structure Recognition of Scientific Bibliographic References (FP, AB), p. 1072–?.
PODS-1997-BeeriLR #query #using- Rewriting Queries Using Views in Description Logics (CB, AYL, MCR), pp. 99–108.
PODS-1997-LudascherML - Referential Actions as Logic Rules (BL, WM, GL), pp. 217–227.
VLDB-1997-BohannonLRSSS #database #in memory #memory management #physics #version control- Logical and Physical Versioning in Main Memory Databases (RR, SS, PB, DWL, AS, SS), pp. 86–95.
DLT-1997-Raeva #ambiguity #semantics- Semantic Interpretation of Ambiguous Statements, Represented in a Logical Form (IR), pp. 529–537.
DLT-1997-Stefaneas #first-order- Chartering first order logic (PSS), pp. 579–592.
ICALP-1997-HarelS #process- Computation Paths Logic: An Expressive, yet Elementary, Process Logic (abridged version) (DH, ES), pp. 408–418.
ICALP-1997-Wilke #first-order #strict- Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic (TW), pp. 347–357.
TLCA-1997-Buciarelli #re-engineering- Logical Reconstruction of Bi-domains (AB), pp. 99–111.
TLCA-1997-RetoreL #commutative #linear- A Non-commutative Extension of Classical Linear Logic (CR, PL), pp. 300–318.
GG-Handbook-Vol1-Courcelle #graph transformation #higher-order #monad- The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic (BC), pp. 313–400.
ACIR-1997-OunisH #approach #information retrieval #relational- A Logical Relational Approach for Information Retrieval Indexing (IO, TWCH).
ICML-1997-BottaGP #first-order #learning #named- FONN: Combining First Order Logic with Connectionist Learning (MB, AG, RP), pp. 46–56.
TOOLS-USA-1997-LahtinenSTT #object-oriented #visualisation- Object-Oriented Visualization of Program Logic (SPL, ES, APT, JT), pp. 76–88.
ALP-1997-Antoy #functional #nondeterminism- Optimal Non-deterministic Functional Logic Computations (SA), pp. 16–30.
ALP-1997-SuzukiNI #calculus #functional #higher-order #lazy evaluation- Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Language (TS, KN, TI), pp. 99–113.
LOPSTR-1997-SemeraroEMFF #datalog #framework #incremental #induction #synthesis- A Logic Framework for the Incremental Inductive Synthesis of Datalog Theories (GS, FE, DM, NF, SF), pp. 300–321.
PLDI-1997-JensenJKS #automation #higher-order #monad #pointer #source code #using #verification- Automatic Verification of Pointer Programs using Monadic Second-Order Logic (JLJ, MEJ, NK, MIS), pp. 226–236.
PLILP-1997-EisingerGP - Logic Implemented Functionally (NE, TG, SP), pp. 351–368.
SAS-1997-Scozzari #analysis- Logical Optimality of Groundness Analysis (FS), pp. 83–97.
RE-1997-ZowghiO #evolution #framework #modelling #reasoning #requirements- A Logical Framework for Modeling and Reasoning About the Evolution of Requirements (DZ, RO), p. 247–?.
ASF+SDF-1997-BorovanskyKK #specification- Rewriting as a unified specification tool for logic and control: the ELAN language (PB, CK, HK), p. 3.
DAC-1997-CroixW #performance #synthesis- A Fast And Accurate Technique To Optimize Characterization Tables For Logic Synthesis (JFC, DFW), pp. 337–340.
DAC-1997-JiangKCM #optimisation #performance- Post-Layout Logic Restructuring for Performance Optimization (YMJ, AK, KTC, MMS), pp. 662–665.
DAC-1997-PantDC #energy #network #optimisation #power management #random- Device-Circuit Optimization for Minimal Energy and Power Consumption in CMOS Random Logic Networks (PP, VD, AC), pp. 403–408.
EDTC-1997-BeniniMMPS #network #optimisation #synthesis- Symbolic synthesis of clock-gating logic for power optimization of control-oriented synchronous networks (LB, GDM, EM, MP, RS), pp. 514–520.
EDTC-1997-UrsuGZ #automaton #design #specification #using #verification- Design and verification of the sequential systems automata using temporal logic specifications (AU, GG, SZ), p. 623.
PDP-1997-Rabenseifner #clustering #monitoring #parallel- The controlled logical clock--a global time for trace-based software monitoring of parallel applications in workstation clusters (RR), pp. 477–484.
TACAS-1997-KelbMMG #flexibility #higher-order #monad #named #tool support- MOSEL: A FLexible Toolset for Monadic Second-Order Logic (PK, TMS, MM, CG), pp. 183–202.
TACAS-1997-RaskinS #abstraction #realtime- Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time (JFR, PYS), pp. 165–182.
TACAS-1997-SchmittG #linear- A Tableau System for Linear-TIME Temporal Logic (PHS, JGL), pp. 130–144.
TAPSOFT-1997-AbadiL #object-oriented #source code- A Logic of Object-Oriented Programs (MA, KRML), pp. 682–696.
TAPSOFT-1997-BouhoulaJM #equation #proving #specification- Specification and Proof in Membership Equational Logic (AB, JPJ, JM), pp. 67–92.
CADE-1997-EhrensbergerZ #named- DiaLog: A System for Dialogue Logic (JE, CZ), pp. 446–460.
CADE-1997-GiunchigliaRS #testing- A New Method for Testing Decision Procedures in Modal Logics (FG, MR, RS), pp. 264–267.
CADE-1997-Hickey #framework #higher-order #implementation #named- Nuprl-Light: An Implementation Framework for Higher-Order Logics (JJH), pp. 395–399.
CADE-1997-KornK - Deciding Intuitionistic Propositional Logic via Translation into Classical Logic (DSK, CK), pp. 131–145.
CADE-1997-KreitzMOS #linear #proving- Connection-Based Proof Construction in Linear Logic (CK, HM, JO, SS), pp. 207–221.
CADE-1997-Slaney #named #proving #theorem proving- Minlog: A Minimal Logic Theorem Prover (JKS), pp. 268–271.
CADE-1997-Vardi #automaton- Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics (MYV), pp. 191–206.
CAV-1997-ImmermanV #model checking #transitive- Model Checking and Transitive-Closure Logic (NI, MYV), pp. 291–302.
CSL-1997-BarberGHP #calculus #linear- From Action Calculi to Linear Logic (AB, PG, MH, GDP), pp. 78–97.
CSL-1997-BraunerP #linear- A Formulation of Linear Logic Based on Dependency-Relations (TB, VdP), pp. 129–148.
CSL-1997-Faggian #proving- Classical Proofs via Basic Logic (CF), pp. 203–219.
CSL-1997-Olive #linear #nondeterminism- A Conjunctive Logical Characterization of Nondeterministic Linear Time (FO), pp. 360–372.
CSL-1997-RuetF #commutative #concurrent #constraints #programming- Concurrent Constraint Programming and Non-commutative Logic (PR, FF), pp. 406–423.
CSL-1997-Schiering #approach #graph #higher-order #monad- A Hierarchical Approach to Monadic Second-Order Logic over Graphs (IS), pp. 424–440.
CSL-1997-Schwentick #higher-order #power of- Padding and the Expressive Power of Existential Second-Order Logics (TS), pp. 461–477.
ICLP-1997-AntoyEH #evaluation #functional #parallel- Parallel Evaluation Strategies for Functional Logic Languages (SA, RE, MH), pp. 138–152.
ICLP-1997-BelleghemDS #logic programming- A Strong Correspondence between Description Logics and Open Logic Programming (KVB, MD, DDS), pp. 346–360.
ILPS-1997-Clarke #model checking- Temporal Logic Model Checking (EMC), p. 3.
ILPS-1997-Davila #named- OPENLOG: A Logic Language to Program Reactive and Rational Agents (JAD), p. 406.
ILPS-1997-Kifer #transaction- Transaction Logic: An Introduction (MK), pp. 47–48.
LICS-1997-BaillotDE #game studies #linear- Believe it or not, AJM’s Games Model is a Model of Classical Linear Logic (PB, VD, TE, LR), pp. 68–75.
LICS-1997-EtessamiVW #first-order- First-Order Logic with Two Variables and Unary Temporal Logic (KE, MYV, TW), pp. 228–235.
LICS-1997-GradelOR #decidability- Two-Variable Logic with Counting is Decidable (EG, MO, ER), pp. 306–317.
LICS-1997-KanovichI #concurrent #linear #process #specification- Temporal Linear Logic Specifications for Concurrent Processes (MIK, TI), pp. 48–57.
LICS-1997-McDowellM #higher-order #reasoning #syntax- A Logic for Reasoning with Higher-Order Abstract Syntax (RM, DM), pp. 434–445.
LICS-1997-PacholskiST #complexity- Complexity of Two-Variable Logic with Counting (LP, WS, LT), pp. 318–327.
LICS-1997-ThiagarajanW #linear- An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces (PST, IW), pp. 183–194.
PODS-1996-AbiteboulHB #database #first-order #query- Temporal Versus First-Order Logic to Query Temporal Databases (SA, LH, JVdB), pp. 49–57.
VLDB-1996-Cuppens #analysis #database #multi #query- Querying a Multilevel Database: A Logical Analysis (FC), pp. 484–494.
WCRE-1996-LakeB #approach #assembly #modelling #reverse engineering #source code- Reverse Engineering of Assembler Programs: A Model-Based Approach and its Logical Basis (TL, TB), pp. 67–75.
ICALP-1996-Mossakowski #framework- Different Types of Arrow Between Logical Frameworks (TM), pp. 158–169.
FME-1996-SeguinW #approach #category theory #fault tolerance #using #validation- Using a Logical and Categorical Approach for the Validation of Fault-Tolerant Systems (CS, VW), pp. 347–366.
ICPR-1996-PalmeroIDC #documentation- A new neuro-fuzzy system for logical labeling of documents (GISP, JMCI, YAD, JLC), pp. 431–435.
KDD-1996-PadmanabhanT #approach #database- Pattern Discovery in Temporal Databases: A Temporal Logic Approach (BP, AT), pp. 351–354.
KR-1996-AmatiP #question #reasoning- Is There a Logic of Provability for Nonmonotonic Reasoning? (GA, FP), pp. 493–503.
KR-1996-BaaderS #strict- Number Restrictions on Complex Roles in Description Logics: A Preliminary Report (FB, US), pp. 328–339.
KR-1996-BasinMV #framework #implementation- Implementing Modal and Relevance Logics in a Logical Framework (DAB, SM, LV), pp. 386–397.
KR-1996-Calvanese #finite #reasoning- Finite Model Reasoning in Description Logics (DC), pp. 292–303.
KR-1996-GiacomoL #reasoning- TBox and ABox Reasoning in Expressive Description Logics (GDG, ML), pp. 316–327.
KR-1996-KautzMS #encoding- Encoding Plans in Propositional Logic (HAK, DAM, BS), pp. 374–384.
KR-1996-Lemon #semantics- Semantical Foundations of Spatial Logics (OL), pp. 212–219.
KR-1996-MonteiroW #multi- Preferential Multi-Agent Nonmonotonic Logics: Preliminary Report (AMM, JW), pp. 446–452.
KR-1996-SiegelF #representation #theorem- A Representation Theorem for Preferential Logics (PS, LF), pp. 453–460.
SEKE-1996-IzumiK - An Object Logic for Object Base Capable of Version Management (NI, TK), pp. 171–180.
SIGIR-1996-MeghiniS #information retrieval- A Relevance Terminological Logic for Information Retrieval (CM, US), pp. 197–205.
SIGIR-1996-RollekeF #retrieval #using- Retrieval of Complex Objects Using a Four-Valued Logic (TR, NF), pp. 206–214.
OOPSLA-1996-Moller #functional #information management #object-oriented #representation- A Functional Layer for Description Logics: Knowledge Representation Meets Object-Oriented Programing (RM), pp. 198–213.
ALP-1996-BandaHM #independence- Independence in Dynamically Scheduled Logic Languages (MJGdlB, MVH, KM), pp. 47–61.
ALP-1996-Caires #process #specification- A Language for the Logical Specification of Processes and Relations (LC), pp. 150–164.
ALP-1996-Marchiori96a #abstract domain #first-order #using- Prime Factorizations of Abstract Domains Using First Order Logic (EM), pp. 209–223.
LOPSTR-1996-LauO #case study #specification- Forms of Logic Specifications: A Preliminary Study (KKL, MO), pp. 295–312.
POPL-1996-GovindarajanJM #constraints #optimisation- Optimization and Relaxation in Constraint Logic Languages (KG, BJ, SM), pp. 91–103.
FSE-1996-DillonR #generative #specification- Generating Oracles from Your Favorite Temporal Logic Specifications (LKD, YSR), pp. 106–117.
ICSE-1996-LinR #configuration management- Configuration Management with Logical Structures (YJL, SPR), pp. 298–307.
SAC-1996-CucuccioGNR #development #fuzzy #product line- W.A.R.P.-ADB: a board family for fuzzy logic applications development (AC, GG, NN, BR), pp. 586–589.
SAC-1996-CucuccioGS #fuzzy #low cost #performance- W.A.R.P and FUZZYSTUDIO: an easy and fast way to implement, With low cost, fuzzy logic control systems (AC, BG, GS), pp. 580–585.
SAC-1996-FisherT #visual notation- A visual logic (JRF, LT), pp. 17–21.
SAC-1996-Fritzke #automation #fuzzy #network- Automatic construction of radial basis function networks with the growing neural gas model and its relevance for fuzzy logic (BF), pp. 624–627.
SAC-1996-HafnerBH #fuzzy- Fuzzy logic applied to compensation equipment in power electronics (JH, HHB, KH), pp. 619–623.
SAC-1996-Langari #approach #fuzzy- Hierarchical approach to fuzzy logic control (RL), pp. 605–608.
DAC-1996-Dahlgren #simulation #using- Oscillation Control in Logic Simulation using Dynamic Dominance Grahps (PD), pp. 155–160.
DAC-1996-LinMCL - Test Point Insertion: Scan Paths through Combinational Logic (CCL, MMS, KTC, MTCL), pp. 268–273.
DAC-1996-Rudell #design #named #synthesis #tutorial- Tutorial: Design of a Logic Synthesis System (RLR), pp. 191–196.
DAC-1996-TheobaldNW #heuristic #named- Espresso-HF: A Heuristic Hazard-Free Minimizer for Two-Level Logic (MT, SMN, TW), pp. 71–76.
DAC-1996-TsaiM #multi #synthesis- Multilevel Logic Synthesis for Arithmetic Functions (CCT, MMS), pp. 242–247.
TAPSOFT-J-1995-HofmannS96 #abstraction #behaviour #higher-order #on the- On Behavioural Abstraction and Behavioural Satisfaction in Higher-Order Logic (MH, DS), pp. 3–45.
TAPSOFT-J-1995-JonssonT96 #linear #specification- Assumption/Guarantee Specifications in Linear-Time Temporal Logic (BJ, YKT), pp. 47–72.
ESOP-1996-BarbutiM #multi #prolog #semantics- A Multiple-Valued Logical Semantics for Prolog (RB, PM), pp. 62–76.
ESOP-1996-Gonzalez-MorenoHLR #declarative #programming- A Rewriting Logic for Declarative Programming (JCGM, MTHG, FJLF, MRA), pp. 156–172.
RWLW-1996-BorovanskyKKMV #framework #named- ELAN: A logical framework based on computational systems (PB, CK, HK, PEM, MV), pp. 35–50.
RWLW-1996-CiampoliniLMS #distributed #implementation- Distributed logic objects: A fragment of rewriting logic and its implementation (AC, EL, PM, CS), pp. 110–125.
RWLW-1996-ClavelM - Reflection and strategies in rewriting logic (MC, JM), pp. 126–148.
RWLW-1996-Diaconescu #behaviour #specification- Foundations of behavioural specification in rewriting logic (RD), pp. 226–245.
RWLW-1996-Landauer - Discrete event systems in rewriting logic (CL), pp. 310–321.
RWLW-1996-Marti-OlietM #framework #semantics- Rewriting logic as a logical and semantic framework (NMO, JM), pp. 190–225.
RWLW-1996-Miyoshi #category theory #modelling- Modelling conditional rewriting logic in structured categories (HM), pp. 20–34.
RWLW-1996-OlveczkyM #realtime #specification- Specifying real-time systems in rewriting logic (PCÖ, JM), pp. 284–309.
RWLW-1996-Schorlemmer - Bi-rewriting rewriting logic (WMS), pp. 266–283.
CADE-1996-BaazFSZ #towards- MUltlog 1.0: Towards an Expert System for Many-Valued Logics (MB, CGF, GS, RZ), pp. 226–230.
CADE-1996-Dixon - Search Strategies for Resolution in Temporal Logics (CD), pp. 673–687.
CADE-1996-GiacomoM #algorithm- Tableaux and Algorithms for Propositional Dynamic Logic with Converse (GDG, FM), pp. 613–627.
CADE-1996-GiunchigliaS #case study- Building Decision Procedures for Modal Logics from Propositional Decision Procedure — The Case Study of Modal K (FG, RS), pp. 583–597.
CADE-1996-Luz-Filho #proving #specification #theorem proving- Grammar Specification in Categorial Logics and Theorem Proving (SFLF), pp. 703–717.
CADE-1996-Nonnengart #calculus- Resolution-Based Calculi for Modal and Temporal Logics (AN), pp. 598–612.
CADE-1996-Tammet #proving #theorem proving- A Resolution Theorem Prover for Intuitonistic Logic (TT), pp. 2–16.
CADE-1996-Voronkov #similarity- Proof-Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification (AV), pp. 32–46.
CAV-1996-MoserMRKD #realtime #tool support #visual notation- The Real-Time Graphical Interval Logic Toolset (LEM, PMMS, YSR, GK, LKD), pp. 446–449.
CSL-1996-Geuvers #dependent type #higher-order #modelling #type system- Extending Models of Second Order Predicate Logic to Models of Second Dependent Type Theory (HG), pp. 167–181.
CSL-1996-Otto #invariant- The Logic of Explicitly Presentation-Invariant Circuits (MO), pp. 369–384.
CSL-1996-Stark #call-by- Call-by-Value, Call-by-Name and the Logic of Values (RFS), pp. 431–445.
CSL-1996-Yashin #problem- New Intuitionistic Logical Constants: Undecidability of the Conservativsness Problem (ADY), pp. 460–471.
JICSLP-1996-BonnerK #communication #concurrent #transaction- Concurrency and Communication in Transaction Logic (AJB, MK), pp. 142–156.
JICSLP-1996-BugliesiDML #calculus #linear- A Linear Logic Calculus Objects (MB, GD, LL, MM), pp. 67–81.
LICS-1996-BentonW #linear #monad #λ-calculus- Linear Logic, Monads and the λ Calculus (PNB, PW), pp. 420–431.
LICS-1996-CervesatoP #framework #linear- A Linear Logical Framework (IC, FP), pp. 264–275.
LICS-1996-DegtyarevV #decidability #problem- Decidability Problems for the Prenex Fragment of Intuitionistic Logic (AD, AV), pp. 503–512.
LICS-1996-EtessamiW - An Until Hierarchy for Temporal Logic (KE, TW), pp. 108–117.
LICS-1996-KolaitisV #on the #power of- On the Expressive Power of Variable-Confined Logics (PGK, MYV), pp. 348–359.
LICS-1996-Pitts #reasoning- Reasoning about Local Variables with Operationally-Based Logical Relations (AMP), pp. 152–163.
LICS-1996-Ramanujam #linear- Locally Linear Time Temporal Logic (RR), pp. 118–127.
ICDAR-v1-1995-NiyogiS #documentation #knowledge-based- Knowledge-based derivation of document logical structure (DN, SNS), pp. 472–475.
ICDAR-v2-1995-ButlerGST #data flow #diagrams #documentation- Analyzing the logical structure of data flow diagrams in software documents (GB, PG, RS, IAT), pp. 575–578.
WCRE-1995-EdwardsM #using- Deriving a Logical Data Model for a System Using the RECAST Method (HME, MM).
DLT-1995-Nitsche #linear #semantics- A Finitary-Language Semantics for Propositional Linear Temporal Logic (UN), pp. 482–489.
DLT-1995-SchieringT #automaton #first-order- Counter-Free Automata, First-Order Logic and Star-Free Expressions (IS, WT), pp. 166–175.
ICALP-1995-DawarHK #finite- Implicit Definability and Infinitary Logic in Finite Model Theory (AD, LH, PGK), pp. 624–635.
RTA-1995-Matiyasevich #on the- On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (YM), p. 1.
TLCA-1995-Bierman #category theory #linear #question #what- What is a Categorical Model of Intuitionistic Linear Logic? (GMB), pp. 78–93.
KDD-1995-AugierVK #algorithm #first-order #learning #search-based- Learning First Order Logic Rules with a Genetic Algorithm (SA, GV, YK), pp. 21–26.
SEKE-1995-ChangDL #concept #knowledge base #object-oriented #relational- Knowledge Based System for Transforming an Object Oriented Conceptual Model into a Relational Logical Model (EC, TSD, AL), pp. 374–382.
SIGIR-1995-Fuhr #datalog #probability #retrieval- Probabilistic Datalog — A Logic For Powerful Retrieval Methods (NF), pp. 282–290.
SIGIR-1995-Meghini #image #modelling #retrieval- An Image Retrieval Model Based on Classical Logic (CM), pp. 300–308.
LOPSTR-1995-GallardoT #abstract interpretation #cost analysis #framework- Studying the Cost of Logic Languages in an Abstract Interpretation Framework for Granularity Analysis (MdMG, JMT), pp. 91–105.
PLILP-1995-HansSW #functional #implementation- An Expression-Or-Parallel Implementation for a Functional Logic Language (WH, FS, SW), pp. 457–458.
PLILP-1995-McEvoyH #linear #locality #multi- Local Linear Logic for Locality Consciousness in Multiset Transformation (HM, PHH), pp. 357–379.
PLILP-1995-ShimajiriSI #database #query- Goal-Directed Query Processing in Disjunctive Logic Databases (YS, HS, HI), pp. 415–430.
ESEC-1995-ZellerS #set- Handling Version Sets Through Feature Logic (AZ, GS), pp. 191–204.
KBSE-1995-KraanB #case study #framework #tool support #verification- Logical Frameworks as a Basis for Verification Tools: A Case Study (IK, PB), pp. 36–43.
SAC-1995-Huntbach95a #concurrent- Search in concurrent logic languages (MMH), pp. 164–170.
SAC-1995-KumblaJB #algorithm #fuzzy #implementation #network #using- Implementation of fuzzy logic and neural networks control algorithm using a digital signal processing chip (KKK, MJ, JBR), pp. 524–528.
DAC-1995-Chamberlain #parallel #simulation- Parallel Logic Simulation of VLSI Systems (RDC), pp. 139–143.
DAC-1995-ImanP #power management- Logic Extraction and Factorization for Low Power (SI, MP), pp. 248–253.
DAC-1995-LinCCMC #synthesis- Logic Synthesis for Engineering Change (CCL, KCC, SCC, MMS, KTC), pp. 647–652.
DAC-1995-MakW #on the- On Optimal Board-Level Routing for FPGA-Based Logic Emulation (WKM, DFW), pp. 552–556.
DAC-1995-MalleyD #verification- Logic Verification Methodology for PowerPC Microprocessors (CHM, MD), pp. 234–240.
DAC-1995-NakamuraY #clustering #matrix #optimisation #scalability- A Partitioning-Based Logic Optimization Method for Large Scale Circuits with Boolean Matrix (YN, TY), pp. 653–657.
DAC-1995-PomeranzR #on the- On Synthesis-for-Testability of Combinational Logic Circuits (IP, SMR), pp. 126–132.
DAC-1995-RohfleischWA #analysis #optimisation- Logic Clause Analysis for Delay Optimization (BR, BW, KA), pp. 668–672.
DAC-1995-VaishnavP - Minimizing the Routing Cost During Logic Extraction (HV, MP), pp. 70–75.
DAC-1995-YuguchiNWF #multi- Multi-Level Logic Minimization Based on Multi-Signal Implications (MY, YN, KW, TF), pp. 658–662.
HPCA-1995-HurSFOK #array #design #fault #parallel #simulation- Massively Parallel Array Processor for Logic, Fault, and Design Error Simulation (YH, SAS, ESF, GEO, SK), pp. 340–347.
LCT-RTS-1995-BonfattiGM #design #programmable- Re-usable Software Design for Programmable Logic Controllers (FB, GG, PDM), pp. 31–40.
PDP-1995-BoianovJ #distributed #network #simulation- Distributed logic circuit simulation on a network of workstations (LB, IJ), pp. 304–310.
TACAS-1995-HenriksenJJKPRS #higher-order #monad #named- Mona: Monadic Second-Order Logic in Practice (JGH, JLJ, MEJ, NK, RP, TR, AS), pp. 89–110.
TAPSOFT-1995-HofmannS #abstraction #behaviour #higher-order #on the- On Behavioral Abstraction and Behavioural Satisfaction in Higher-Order Logic (MH0, DS), pp. 247–261.
TAPSOFT-1995-JonssonT #linear #specification- Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract) (BJ, YKT), pp. 262–276.
TAPSOFT-1995-Karger #algebra #approach- An Algebraic Approach to Temporal Logic (BvK), pp. 232–246.
TAPSOFT-1995-Potthoff #finite #first-order- First-Order Logic on Finite Trees (AP), pp. 125–139.
CAV-1995-AzizSB #probability- It Usually Works: The Temporal Logic of Stochastic Systems (AA, VS, FB), pp. 155–165.
CAV-1995-BasinK #hardware #higher-order #monad #using #verification- Hardware Verification using Monadic Second-Order Logic (DAB, NK), pp. 31–41.
CAV-1995-EsparzaK #branch #model checking #on the #parallel #problem #process- On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes (JE, AK), pp. 353–366.
CAV-1995-Kupferman #branch #quantifier- Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions (OK), pp. 325–338.
ICLP-1995-JacquetB #concurrent #on the #process- On Composing Concurrent Logic Processes (JMJ, KDB), pp. 531–545.
ICLP-1995-ShimajiriSI #database #query- Making Query Processing Goal-Directed in Disjunctive Logic Databases (YS, HS, HI), p. 820.
ILPS-1995-GovindarajanJM #constraints- Relaxation in Constraint Logic Languages (KG, BJ, SM), p. 637.
ILPS-1995-LevyR #overview- Combining Rules and Description Logics: An Overview of CARIN (AYL, MCR), p. 635.
ILPS-1995-Moss - Logic and Objects (CM), pp. 609–611.
LICS-1995-Comon #automaton #higher-order #monad- Sequentiality, Second Order Monadic Logic and Tree Automata (HC), pp. 508–517.
LICS-1995-Dutertre #first-order #proving- Complete Proof Systems for First Order Interval Temporal Logic (BD), pp. 36–43.
LICS-1995-Kanovich #complexity #linear- The Complexity of Neutrals in Linear Logic (MIK), pp. 486–495.
LICS-1995-Kopylov #decidability #linear- Decidability of Linear Affine Logic (APK), pp. 496–504.
LICS-1995-Lamarche #game studies #linear #semantics- Games Semantics for Full Propositional Linear Logic (FL), pp. 464–473.
LICS-1995-LincolnSS #higher-order #linear #problem- Decision Problems for Second-Order Linear Logic (PL, AS, NS), pp. 476–485.
LICS-1995-LongoMS #type system- A Logic of Subtyping (GL, KM, SS), pp. 292–299.
LICS-1995-LynchT #graph #random- The Infinitary Logic of Sparse Random Graphs (JFL, JT), pp. 46–53.
LICS-1995-MarekNR #complexity #reasoning- Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning (VWM, AN, JBR), pp. 178–185.
LICS-1995-Seth #complexity #fixpoint #question- When Do Fixed Point Logics Capture Complexity Classes? (AS), pp. 353–363.
LICS-1995-Simpson #composition- Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS (AKS), pp. 420–430.
LICS-1995-Trakhtenbrot #automaton- Origins and Metamorphoses of the Trinity: Logic, Nets, Automata (BAT), pp. 506–507.
CSEE-1994-GriesS #education- Teaching Logic as a Tool (DG, FBS), p. 599.
ICALP-1994-Brauner - A Model of Intuitionistic Affine Logic From Stable Domain Theory (TB), pp. 340–351.
ICALP-1994-GlobermanH #automaton #complexity #multi- Complexity Results for Multi-Pebble Automata and their Logics (NG, DH), pp. 73–82.
ICALP-1994-PlotkinW #linear- Bistructures, Bidomains and Linear Logic (GDP, GW), pp. 352–363.
TAGT-1994-Courcelle #composition #graph #higher-order #monad- The Definition in Monadic Second-Order Logic of Modular Decompositions of Ordered Graphs (BC), pp. 487–501.
CIKM-1994-Borgida #on the- On The Relationship Between Description Logic and Predicate Logic (AB), pp. 219–225.
KDD-1994-LaerDR - Applications of a Logical Discovery Engine (WVL, LD, LDR), pp. 263–274.
KDD-1994-Tsukimoto - The Discovery of Logical Propositions in Numerical Data (HT), pp. 205–216.
KR-1994-ArtaleF - A Computational Account for a Description Logic of Time and Action (AA, EF), pp. 3–14.
KR-1994-Bennett #reasoning- Spatial Reasoning with Propositional Logics (BB), pp. 51–62.
KR-1994-Boutilier #towards- Toward a Logic for Qualitative Decision Theory (CB), pp. 75–86.
KR-1994-CadoliEG #query- Default Logic as a Query Language (MC, TE, GG), pp. 99–108.
KR-1994-CohenH #learning- Learning the Classic Description Logic: Theoretical and Experimental Results (WWC, HH), pp. 121–133.
KR-1994-FriedmanH94a #complexity #on the- On the Complexity of Conditional Logics (NF, JYH), pp. 202–213.
KR-1994-HoekJT - Honesty in Partial Logic (WvdH, JJ, ET), pp. 583–594.
KR-1994-Jaeger #probability #reasoning- Probabilistic Reasoning in Terminological Logics (MJ), pp. 305–316.
KR-1994-Jiang #multi #on the #perspective- On Multiagent Autoepistemic Logic : An Extrospective View (YJ), pp. 317–328.
KR-1994-Koehler #reasoning- An Application of Terminological Logics to Case-based Reasoning (JK), pp. 351–362.
KR-1994-KuipersS #reasoning- Reasoning in Logic about Continuous Systems (BK, BS), pp. 391–402.
KR-1994-LinR #database #how #why- How to Progress a Database (and Why) I. Logical Foundations (FL, RR), pp. 425–436.
KR-1994-PadghamL #framework- A Framework for Part-of Hierarchies in Terminological Logics (LP, PL), pp. 485–496.
KR-1994-Teege #difference- Making the Difference: A Subtraction Operation for Description Logics (GT), pp. 540–550.
SEKE-1994-ChauC #flexibility #specification #visual notation- A visual logic specification of flexible manufacturing systems (HLC, KGC), pp. 438–445.
SEKE-1994-MiyakawaY - Temporal logic extended with object creation and destruction (SM, NY), pp. 156–163.
SEKE-1994-Pliuskeviciene #hoare #recursion- Specialization of derivations in Hoare-like logic with recursive procedures (AP), pp. 124–130.
SEKE-1994-Sakalauskaite #branch #calculus #first-order- A complete sequent calculus for a first order branching temporal logic (JS), pp. 274–280.
SIGIR-1994-Sebastiani #information retrieval #modelling #probability- A Probabilistic Terminological Logic for Modelling Information Retrieval (FS0), pp. 122–130.
ECOOP-1994-WieringaJS #approach #subclass- Roles and Dynamic Subclasses: A Modal Logic Approach (RW, WdJ, PS), pp. 32–59.
TOOLS-EUROPE-1994-Firesmith #analysis #design #requirements- O-O Requirements Analysis and Logical Design (DF), p. 513.
TOOLS-EUROPE-1994-KarakostasP #automation #c++ #hybrid #specification- Automatic Transformation of Hybrid Object and Logic Specification to C++ Code (VK, LP), pp. 363–373.
ALP-1994-BidoitH #behaviour #first-order #proving #standard #theorem- Proving Behavioural Theorems with Standard First-Order Logic (MB, RH), pp. 41–58.
LOPSTR-1994-SemeraroEMBP #case study #learning #source code- Avoiding Non-Termination when Learning Logical Programs: A Case Study with FOIL and FOCL (GS, FE, DM, CB, MJP), pp. 183–198.
PLILP-1994-BelkhirN #functional #towards #using- Towards Integrating Functional and Logic Styles Using Relation (AB, NN), pp. 463–464.
PLILP-1994-BugliesiJ #encapsulation #object-oriented- A Logic for Encapsulation in Object Oriented Languages (MB, HMJ), pp. 215–229.
PLILP-1994-Grivas #compilation #constraints #functional #symbolic computation #towards- Towards a Constraint Functional Logic Compiler for Symbolic Computation Systems (GG), pp. 455–456.
PLILP-1994-RodriguesB #named #programming- PROMAL — Programming in Modal Action Logic (OR, MRFB), pp. 457–458.
ICSE-1994-DevanbuJ #case study #experience #using- The Use of Description Logics in KBSE Systems: Experience Report (PTD, MAJ), pp. 23–35.
SAC-1994-KumarH #concept #fuzzy #reduction #using- Reduction of communications in a MasPar computer using fuzzy logic concepts (AGK, JH), pp. 351–356.
SAC-1994-Negoita #fuzzy #injection #realtime- Fuzzy logic real-time intelligent control of fuel injection engines (MGN), pp. 110–114.
SAC-1994-PalmS #fuzzy #optimisation #using- Torque optimization for a locomotive using fuzzy logic (RP, KS), pp. 105–109.
SAC-1994-RothermelT #learning #overview- Test Review: a new method of computer-assisted learning to promote careful reading and logical skills (DR, GT), pp. 573–577.
DAC-1994-ChangCWM #layout #synthesis- Layout Driven Logic Synthesis for FPGAs (SCC, KTC, NSW, MMS), pp. 308–313.
DAC-1994-ChouLCDL #clustering- Circuit Partitioning for Huge Logic Emulation Systems (NCC, LTL, CKC, WJD, RL), pp. 244–249.
DAC-1994-ImanPC #fuzzy #using- Technology Mapping Using Fuzzy Logic (SI, MP, KC), pp. 333–338.
DAC-1994-IwamaH #generative #random- Random Generation of Test Instances for Logic Optimizers (KI, KH), pp. 430–434.
DAC-1994-JyuM #design #modelling #statistics #synthesis- Statistical Delay Modeling in Logic Design and Synthesis (HFJ, SM), pp. 126–130.
DAC-1994-MonteiroDL #estimation #performance #process- A Methodology for Efficient Estimation of Switching Activity in Sequential Logic Circuits (JCM, SD, BL), pp. 12–17.
DAC-1994-SarabiSCP #2d #approach #array #design #physics #synthesis- A Comprehensive Approach to Logic Synthesis and Physical Design for Two-Dimensional Logic Arrays (AS, NS, MCJ, MAP), pp. 321–326.
DAC-1994-TomitaYSH #design #fault #multi- Rectification of Multiple Logic Design Errors in Multiple Output Circuits (MT, TY, FS, KH), pp. 212–217.
EDAC-1994-AkitaA #power management #probability- A Method for Reducing Power Consumption of CMOS Logic Based on Signal Transition Probability (JA, KA), pp. 420–424.
EDAC-1994-BurgunDGPS #complexity #multi #synthesis- Multilevel Logic Synthesis of Very High Complexity Circuits (LB, ND, AG, EP, CS), p. 669.
EDAC-1994-LiW #automaton #fault #simulation- Logic and Fault Simulation by Cellular Automata (YLL, CWW), pp. 552–556.
EDAC-1994-NguyenTDTV #cpu #synthesis #verification- Logic Synthesis and Verification of the CPU and Caches of a Mainframe System (HNN, JPT, LD, MT, PV), pp. 60–64.
EDAC-1994-RohfleischB #optimisation- Introduction of Permissible Bridges with Application to Logic Optimization after Technology Mapping (BR, FB), pp. 87–93.
EDAC-1994-Sachdev #testing- Transforming Sequential Logic in Digital CMOS ICs for Voltage and IDDQ Testing (MS), pp. 361–365.
EDAC-1994-WurthW #multi #optimisation #performance- Efficient Calculation of Boolean Relations for Multi-Level Logic Optimization (BW, NW), pp. 630–634.
HPDC-1994-MoralesA #design #implementation #protocol- Design of a Header Processor for the PSi Implementation of the Logical Link Control Protocol in LANs (FAM, HAA), pp. 270–277.
PDP-1994-HowardKTAJ #configuration management #named #novel #parallel #using- Zelig: A Novel Parallel Computing Machine Using Reconfigurable Logic (NJH, AK, AMT, NMA, AJJ), pp. 70–75.
ESOP-1994-Li94a #evolution #framework #specification- A Logical Framework for Evolution of Specifications (WL), pp. 394–408.
ESOP-1994-MuckS #continuation #functional #semantics- A Tiny Constrain Functional Logic Language and Its Continuation Semantics (AM, TS), pp. 439–453.
ESOP-1994-PierroP #constraints #logic programming #semantics- A Logical Denotational Semantics for Constraint Logic Programming (ADP, CP), pp. 195–210.
CADE-1994-KerberK - A Mechanization of Strong Kleene Logic for Partial Functions (MK, MK), pp. 371–385.
CADE-1994-Massacci - Strongly Analytic Tableaux for Normal Modal Logics (FM), pp. 723–737.
CADE-1994-RichardsKSW #named- Mollusc: A General Proof-Development Shell for Sequent-Based Logics (BLR, IK, AS, GAW), pp. 826–830.
CADE-1994-SturgillS #first-order #novel #parallel- A Novel Asynchronous Parallelism Scheme for First-Order Logic (DBS, AMS), pp. 484–498.
CAV-1994-CyrlukN #hardware #verification- Ground Temporal Logic: A Logic for Hardware Verification (DC, PN), pp. 247–259.
ICLP-1994-Jiang #logic programming #semantics- Ambivalent Logic as the Semantic Basis of Metalogic Programming (YJ), pp. 387–401.
ICLP-1994-KumonH #concurrent- A New Transformation based on Process-Message Duality for Concurrent Logic Languages (KK, KH), pp. 684–698.
ICLP-1994-ProiettiP - Completeness of Some Transformation Strategies for Avoiding Unnecessary Logical Variables (MP, AP), pp. 714–729.
ICLP-1994-Silcrat #algebra #static analysis- Logic, Algebra and Static Analysis in DM Systems, the IE Way (EDS), p. 744.
ILPS-1994-McCartyS #first-order #interpreter #prolog- A PROLOG Interpreter for First-Order Intuitionistic Logic (LTM, LAS), p. 685.
LICS-1994-ArieliA #consistency- Logical Bilattices and Inconsistent Data (OA, AA), pp. 468–476.
LICS-1994-Ben-DavidB #reasoning- a modal logic for subjective default reasoning (SBD, RBE), pp. 477–486.
LICS-1994-BrogiT #algebra #semantics #source code- Semantics of Meta-Logic in an Algebra of Programs (AB, FT), pp. 262–270.
LICS-1994-Hemaspaandra #complexity- Complexity Transfer for Modal Logic (EH), pp. 164–173.
LICS-1994-LincolnS #calculus #first-order #linear #proving- Proof Search in First-Order Linear Logic and Other Cut-Free Sequent Calculi (PL, NS), pp. 282–291.
LICS-1994-Loader #linear- Linear Logic, Totality and Full Completeness (RL), pp. 292–298.
LICS-1994-Miller #multi- A Multiple-Conclusion Meta-Logic (DM), pp. 272–281.
LICS-1994-Moggi #evaluation #semantics- A General Semantics for Evaluation Logic (EM), pp. 353–362.
LICS-1994-Thiagarajan #linear- A Trace Based Extension of Linear Time Temporal Logic (PST), pp. 438–447.
ICDAR-1993-KimSK #diagrams #identification #recognition- Recognition of logic diagrams by identifying loops and rectilinear polylines (SHK, JWS, JHK), pp. 349–352.
SIGMOD-1993-MeseguerQ #database #object-oriented #semantics- A Logical Semantics for Object-Oriented Databases (JM, XQ), pp. 89–98.
SIGMOD-1993-Wade #database #distributed- Single Logical View over Enterprise-Wide Distributed Databases (AEW), pp. 441–444.
VLDB-1993-PoulovassilisS #approach #database #functional- A Domain-theoretic Approach to Integrating Functional and Logic Database Languages (AP, CS), pp. 416–428.
VLDB-1993-SrivastavaRSS #database #object-oriented- Coral++: Adding Object-Orientation to a Logic Database Language (DS, RR, PS, SS), pp. 158–170.
CSM-1993-EdwardsM #lifecycle #using- Abstracting the Logical Processing Life Cycle for Entities Using the RECAST Method (HME, MM), pp. 162–171.
DLT-1993-Cazanescu #equation- Local Equational Logic II (VEC), pp. 210–221.
ICALP-1993-BrownG #category theory #petri net- Temporal Logic and Categories of Petri Nets (CB, DG), pp. 570–581.
ICALP-1993-EbingerM #infinity- Logical Definability on Infinite Traces (WE, AM), pp. 335–346.
ICALP-1993-LodayaT #decidability #partial order- Decidability of a Partial Order Based Temporal Logic (KL, PST), pp. 582–592.
FME-1993-ChenM #realtime #specification- Applications of Modal Logic for the Specification of Real-Time Systems (LC, AM), pp. 235–249.
FME-1993-Martin #encoding- Encoding W: A Logic for Z in 2OBJ (AM), pp. 462–481.
RTA-1993-Backofen - Regular Path Expression in Feature Logic (RB), pp. 121–135.
TLCA-1993-BarbaneraB #reduction- Extracting Constructive Content from Classical Logic via Control-like Reductions (FB, SB), pp. 45–59.
TLCA-1993-BentonBPH #calculus #linear- A Term Calculus for Intuitionistic Linear Logic (PNB, GMB, VdP, MH), pp. 75–90.
TLCA-1993-JacobsM #dependent type #higher-order #type system- Translating Dependent Type Theory into Higher Order Logic (BJ, TFM), pp. 209–229.
TLCA-1993-PlotkinA #morphism #parametricity #polymorphism- A Logic for Parametric Polymorphism (GDP, MA), pp. 361–375.
FPCA-1993-Liu #evaluation #functional #lazy evaluation #nondeterminism #towards- Towards Lazy Evaluation, Sharing and Non-determinism in Resolution Based Functional Logic Languages (FL), pp. 201–209.
CIKM-1993-Devanbu #query- Translating Description Logics to Information Server Queries (PTD), pp. 256–263.
CIKM-1993-Tari #concept #modelling #paradigm- ERC++: A Conceptual Data Model Based on Object and Logic Paradigms (ZT), pp. 625–634.
CIKM-1993-WuS #deduction #validation- Rule Validation Based on Logical Deduction (PW, SYWS), pp. 164–173.
SEKE-1993-Paterno #user interface #using- Definition of Properties of User Interfaces Using Action-Based Temporal Logic (FP), pp. 314–318.
SEKE-1993-VazirgiannisPTH #design #fuzzy #hypermedia #information management #object-oriented #representation- Hypermedia and Knowledge Representation: An Object-Oriented Design Based on Fuzzy Logic (MV, KP, AT, MH), pp. 337–342.
SEKE-1993-YoshiuraY #specification- More Expressive Temporal Logic for Specifications (NY, NY), pp. 363–366.
SIGIR-1993-MeghiniSST #information retrieval- A Model of Information Retrieval Based on a Terminological Logic (CM, FS, US, CT), pp. 298–307.
TOOLS-PACIFIC-1993-Firesmith93c #analysis #design #object-oriented #requirements- Object-Oriented Requirements Analysis and Logical Design (DF), p. 319.
LOPSTR-1993-BoeckC #prolog- Mechanical Transformation of Logic Definitions Augmented with Type Information into Prolog Procedures: Some Experiments (PDB, BLC), pp. 229–245.
PLILP-1993-DarlingtonGK #functional #linear #perspective #programming language- Functional Programming Languages with Logical Variables: A Linear Logic View (JD, YG, MK), pp. 201–219.
PLILP-1993-DovierP #implementation #set- A WAM-Based Implementation of a Logical Language with Sets (AD, EP), pp. 275–290.
POPL-1993-Mairson #multi #type system- A Constructive Logic of Multiple Subtyping (HGM), pp. 313–324.
POPL-1993-Reynolds #morphism #parametricity #polymorphism #tutorial- An Introduction to Logical Relations and Parametric Polymorphism — Tutorial (JCR), pp. 155–156.
FSE-1993-Turpin #approach #data type- A Logical Approach to Data Structures (RT), pp. 138–148.
SAC-1993-Larouk #approach #statistics- Linguistico-Statistical Approach and Logics Applied in Documentary System (OL), pp. 737–744.
SAC-1993-ReimersC #automation #database #navigation #relational- Automatic Logical Navigation for Relational Databases (PER, SMC), pp. 343–350.
DAC-1993-ChungWH #design #fault- Diagnosis and Correction of Logic Design Errors in Digital Circuits (PYC, YMW, INH), pp. 503–508.
DAC-1993-CoudertMF - A New Viewpoint on Two-Level Logic Minimization (OC, JCM, HF), pp. 625–630.
DAC-1993-DamianiYM #optimisation- Optimization of Combinational Logic Circuits Based on Compatible Gates (MD, JCYY, GDM), pp. 631–636.
DAC-1993-KajiharaPKR #effectiveness #fault #generative #testing- Cost-Effective Generation of Minimal Test Sets for Stuck-at Faults in Combinational Logic Circuits (SK, IP, KK, SMR), pp. 102–106.
DAC-1993-LaiPV #composition #synthesis- BDD Based Decomposition of Logic Functions with Application to FPGA Synthesis (YTL, MP, SBKV), pp. 642–647.
DAC-1993-McGeerSBS #named- Espresso-Signature: A New Exact Minimizer for Logic Functions (PCM, JVS, RKB, ALSV), pp. 618–624.
DAC-1993-Mehendale #design #evaluation #independence #named- MIM: Logic Module Independent Technology Mapping for Design and Evaluation of Antifuse-based FPGAs (MM), pp. 219–223.
DAC-1993-YuanPR #component #evaluation #simulation- Evaluation of Parts by Mixed-Level DC-Connected Components in Logic Simulation (DCY, LTP, JTR), pp. 367–372.
PDP-1993-FilloqueBP #distributed #parallel- Distributed synchronization on a parallel machine with a logic layer (JMF, CB, BP), pp. 53–58.
SOSP-1993-JongeKH #approach #file system- The Logical Disk: A New Approach to Improving File Systems (WdJ, MFK, WCH), pp. 15–28.
TAPSOFT-1993-AhmedV #sequence- A Propositional Dense Time Logic (Based on Nested Sequences) (MA, GV), pp. 584–598.
TAPSOFT-1993-Tyszkiewicz #on the- On Asymptotic Probabilities in Logics That Capture DSPACE(log n) in Presence of Ordering (JT), pp. 569–583.
CAV-1993-Brayton #design #synthesis #verification- Logic Synthesis and Design Verification (RKB), pp. 1–2.
CAV-1993-ClarkeFJ #model checking #symmetry- Exploiting Symmetry In Temporal Logic Model Checking (EMC, TF, SJ), pp. 450–462.
CAV-1993-HennessyL #message passing #process- A Modal Logic for Message passing Processes (MH, XL), pp. 359–370.
CAV-1993-KestenMMP #algorithm- A Decision Algorithm for Full Propositional Temporal Logic (YK, ZM, HM, AP), pp. 97–109.
CAV-1993-KuttyRMDM #concurrent #tool support #verification #visual notation- A Graphical Interval Logic Toolset for Verifying Concurrent Systems (GK, YSR, LEM, LKD, PMMS), pp. 138–153.
CSL-1993-Gomolko #consistency #nondeterminism #prolog- Negation as Inconsistency in PROLOG via Intuitionistic Logic (AG), pp. 128–138.
CSL-1993-Grohe #bound #fixpoint- Bounded-Arity Hierarchies in Fixed-Point Logics (MG), pp. 150–164.
CSL-1993-Kozen #aspect-oriented #constraints #set- Logical Aspects of Set Constraints (DK), pp. 175–188.
ICLP-1993-HuitouzeLR #prolog- Logic Grammars and λ-Prolog (SLH, PL, OR), pp. 64–79.
ICLP-1993-McCarty #higher-order #induction #prolog #proving #source code- Proving Inductive Properties of Prolog Programs in Second-Order Intuitionistic Logic (LTM), pp. 44–63.
ILPS-1993-Ait-Kaci #equation #inheritance #programming- An introduction to LIFE: Programming with Logic, Inheritance, Functions, and Equations (HAK), pp. 52–68.
ILPS-1993-Andrews #prolog #semantics- A Logical Semantics for Depth-First Prolog with Ground Negation (JHA), pp. 220–234.
ILPS-1993-Boden - The Logic of Creativity (MAB), pp. 3–11.
ILPS-1993-EiterG #complexity #logic programming- Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics (TE, GG), pp. 266–278.
ILPS-1993-GrecoSZ #optimisation #programming #query- Dynamic Programming Optimization for Logic Queries with Aggregates (SG, DS, CZ), pp. 575–589.
ILPS-1993-Harland #on the- On Goal-Directed Provability in Classical Logic (JH), p. 677.
ILPS-1993-McDonaldXEF #on the #semantics- On the Denotational and Logical Semantics of CLP-Modules (BM, JX, ME, EF), p. 658.
ILPS-1993-Meyer #reasoning #towards #visual notation- Logic and the Structure of Space — Towards a Visual Logic for Spatial Reasoning (BM), p. 674.
ILPS-1993-Pimentel #concurrent #object-oriented- L2||O2: A Concurrent Object-oriented Logic Language (EP), p. 665.
ILPS-1993-Shilcrat #framework- Id Est, A Logic Based Framework for Direct Manipulation Systems (EDS), p. 646.
VLDB-1992-AgrawalA #performance- Resilient Logical Structures for Efficient Management of Replicated Data (DA, AEA), pp. 151–162.
VLDB-1992-RamakrishnanSS #named- CORAL — Control, Relations and Logic (RR, DS, SS), pp. 238–250.
ICALP-1992-KolaitisV - Infinitary Logic for Computer Science (PGK, MYV), pp. 450–473.
LFP-1992-ChirimarGR #invariant #linear #memory management #proving- Proving Memory Management Invariants for a Language Based on Linear Logic (JC, CAG, JGR), pp. 139–150.
CHI-1992-KimL #composition #design #functional #object-oriented #process #towards- Towards a model of cognitive process in logical design: comparing object-oriented and traditional functional decomposition software methodologies (JK, FJL), pp. 489–498.
KR-1992-Arlo-CostaS - Maps Between Nonmonotonic and Conditional Logic (HLAC, SJS), pp. 553–564.
KR-1992-BenferhatDP #representation- Representing Default Rules in Possibilistic Logic (SB, DD, HP), pp. 673–684.
KR-1992-BollingerP #constraints #order- An Order-Sorted Logic with Sort Literals and Disjointness Constraints (TB, UP), pp. 413–424.
KR-1992-Borgida #development #towards- Towards the Systematic Development of Description Logic Reasoners: CLASP Reconstructed (AB), pp. 259–269.
KR-1992-CroccoL #on the- On the Connection between Non-monotonic Inference Systems and Conditional Logics (GC, PL), pp. 565–571.
KR-1992-Delgrande - Accessibility in Logics of Explicit Belief (JPD), pp. 450–461.
KR-1992-GabbayO #higher-order #quantifier- Quantifier Elimination in Second-Order Predicate Logic (DMG, HJO), pp. 425–435.
KR-1992-KollerH #approximate #reasoning- A Logic for Approximate Reasoning (DK, JYH), pp. 153–164.
KR-1992-Lownie - A Contraction Operator For Classical Propositional Logic (TML), pp. 720–731.
KR-1992-QuantzR #semantics- A Preference Semantics for Defaults in Terminological Logics (JQ, VR), pp. 294–305.
KR-1992-RandellCC - A Spatial Logic based on Regions and Connection (DAR, ZC, AGC), pp. 165–176.
KR-1992-Sadek #case study- A Study in the Logic of Intention (MDS), pp. 462–473.
KR-1992-Schwarz #bound- Bounding Introspection in Nonmonotonic Logic (GS), pp. 581–590.
ML-1992-FengM #higher-order #induction #towards- Towards Inductive Generalization in Higher Order Logic (CF, SM), pp. 154–162.
SEKE-1992-Antoniou #composition #knowledge base- Modularity for Logical Knowledge Bases (GA), pp. 87–93.
SEKE-1992-ChanH #towards- Towards Integrating Logic, Object, Frame, and Production (TWC, WRH), pp. 463–469.
SEKE-1992-KaoH #graph #proving #realtime- A Graph Proof Procedure for Real Time Logic (JHK, LJH), pp. 300–306.
SIGIR-1992-Hess #documentation #incremental #retrieval- An Incrementally Extensible Document Retrieval System Based on Linguistic and Logical Principles (MH), pp. 190–197.
SIGIR-1992-Nie #information retrieval #probability #semantics #towards- Towards a Probabilistic Modal Logic for Semantic-based Information Retrieval (JYN), pp. 140–151.
TOOLS-USA-1992-Mandrioli92a #approach #object-oriented #realtime #specification- Associated paper: The Specification of Real-Time Systems: a Logical, Object-Oriented Approach (DM), p. 277.
PLILP-1992-LiG #named- ProQuery: Logical Access to an OODB (CML, PYG), pp. 487–488.
POPL-1992-JagadeesanP #functional #higher-order #semantics- Abstract Semantics for a Higher-Order Functional Language with Logic Variables (RJ, KP), pp. 355–366.
WSA-1992-Baker-Finch #analysis #strict- Relevant Logic and Strictness Analysis (CABF), pp. 221–228.
DAC-1992-BatekH - Test-Set Preserving Logic Transformations (MJB, JPH), pp. 454–458.
DAC-1992-BoseA #concurrent #fault #memory management #message passing #multi #simulation- Concurrent Fault Simulation of Logic Gates and Memory Blocks on Message Passing Multicomputers (SB, PA), pp. 332–335.
DAC-1992-ChakrabortyAB #fault #generative #modelling #random #testing- Delay Fault Models and Test Generation for Random Logic Sequential Circuits (TJC, VDA, MLB), pp. 165–172.
DAC-1992-ChenF #algorithm #optimisation #performance #set- Efficient Sum-to-One Subsets Algorithm for Logic Optimization (KCC, MF), pp. 443–448.
DAC-1992-DamianiM #equation #optimisation- Recurrence Equations and the Optimization of Synchronous Logic Circuits (MD, GDM), pp. 556–561.
DAC-1992-DevadasKMW #verification- Certified Timing Verification and the Transition Delay of a Logic Circuit (SD, KK, SM, ARW), pp. 549–555.
DAC-1992-Fishburn #heuristic #named- LATTIS: An Iterative Speedup Heuristic for Mapped Logic (JPF), pp. 488–491.
DAC-1992-Hirose #evaluation #performance #simulation- Performance Evaluation of an Event-Driven Logic Simulation Machine (FH), pp. 428–431.
DAC-1992-HsuS #algebra #multi #synthesis- Coalgebraic Division for Multilevel Logic Synthesis (WJH, WZS), pp. 438–442.
DAC-1992-LeeM #multi #simulation- Two New Techniques for Compiled Multi-Delay Logic Simulation (YSL, PMM), pp. 420–423.
DAC-1992-LinS #approach #fuzzy #problem- Fuzzy Logic Approach to Placement Problem (RBL, ES), pp. 153–158.
DAC-1992-ZeinED #named- HLSIM — A New Hierarchical Logic Simulator and Netlist Converter (DAZ, OPE, GSD), pp. 432–437.
STOC-1992-GroveHK #first-order- Asymptotic Conditional Probabilities for First-Order Logic (AJG, JYH, DK), pp. 294–305.
CADE-1992-Ammon #analysis #automation #proving- Automatic Proofs in Mathematical Logic and Analysis (KA), pp. 4–19.
CADE-1992-Bauer #multi- An Interval-based Temporal Logic in a Multivalued Setting (MB), pp. 355–369.
CADE-1992-BeckertGHK #multi #proving #theorem proving- The Tableau-Based Theorem Prover 3TAP for Multi-Valued Logics (BB, SG, RH, WK), pp. 758–760.
CADE-1992-CaferraD #proving #semantics- Semantic Entailment in Non Classical Logics Based on Proofs Found in Classical Logic (RC, SD), pp. 385–399.
CADE-1992-Cohn - A Many Sorted Logic with Possibly Empty Sorts (AGC), pp. 633–647.
CADE-1992-DoughertyJ #approach #combinator #higher-order- A Combinatory Logic Approach to Higher-order E-unification (DJD, PJ), pp. 79–93.
CADE-1992-Schumann #named #proving #theorem proving- KPROP — An AND-parallel Theorem Prover for Propositional Logic implemented in KL1 (JS), pp. 740–742.
CADE-1992-VershininR #nondeterminism- One More Logic with Uncertainty and Resolution Principle for it (KV, IR), pp. 663–667.
CADE-1992-Voronkov #proving #standard #theorem proving- Theorem Proving in Non-Standard Logics Based on the Inverse Method (AV), pp. 648–662.
CADE-1992-Wos #automation #reasoning- The Impossibility of the Automation of Logical Reasoning (LW), pp. 1–3.
CAV-1992-AagaardL #case study #synthesis #verification- Verifying a Logic Synthesis Tool in Nuprl: A Case Study in Software Verification (MA, ML), pp. 69–81.
CAV-1992-HamaguchiHY #branch #design #using #verification- Design Verification of a Microprocessor Using Branching Time Regular Temporal Logic (KH, HH, SY), pp. 206–219.
CAV-1992-Kaivola #composition #linear #model checking- Compositional Model Checking for Linear-Time Temporal Logic (RK), pp. 248–259.
CSL-1992-AanderaaJ #linear #recursion- Recursive Inseparability in Linear Logic (SA, HRJ), pp. 5–13.
CSL-1992-ArtemovS #proving- The Basic Logic of Proofs (SNA, TS), pp. 14–28.
CSL-1992-Bosse #fixpoint #game studies- An “Ehrenfeucht-Fraïssé Game” for Fixpoint Logic and Stratified Fixpoint Logic (UB), pp. 100–114.
CSL-1992-Lautemann #monad #problem- Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates (CL), pp. 327–339.
CSL-1992-Stewart #bound #polynomial #query- Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines (IAS), pp. 410–424.
JICSLP-1992-Bonatti #framework #logic programming #semantics #source code- Autoepistemic Logics as a Unifying Framework for the Semantics of Logic Programs (PAB), pp. 417–430.
JICSLP-1992-KuchenLMR #constraints #functional #implementation #lazy evaluation- Implementing a Lazy Functional Logic Language with Disequality Constraints (HK, FJLF, JJMN, MRA), pp. 207–221.
JICSLP-1992-Mitchell #architecture #physics #programming- The Logic of Architecture: Programming the Invention of Physical Artifacts (WJM), pp. 831–846.
JICSLP-1992-Troelstra #linear #tutorial- Tutorial on Linear Logic (AST), pp. 30–31.
LICS-1992-GonthierAL #linear- Linear Logic Without Boxes (GG, MA, JJL), pp. 223–234.
LICS-1992-GraedelM #nondeterminism #transitive- Deterministic vs. Nondeterministic Transitive Closure Logic (EG, GLM), pp. 58–63.
LICS-1992-HalpernK - Zero-One Laws for Modal Logic (JYH, BMK), pp. 369–380.
LICS-1992-Hella - Logical Hierarchies in PTIME (LH), pp. 360–368.
LICS-1992-Kanovich #linear #programming- Horn Programming in Linear Logic Is NP-Complete (MIK), pp. 200–210.
LICS-1992-KolaitisV #fixpoint- Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory (PGK, MYV), pp. 46–57.
LICS-1992-Schwarz #semantics- Minimal Model Semantics for Nonmonotonic Modal Logics (GS), pp. 34–43.
ICALP-1991-TannenS #aspect-oriented #programming #set- Logical and Computational Aspects of Programming with Sets/Bags/Lists (VT, RS), pp. 60–75.
ICALP-1991-Thomas #automaton #on the- On Logics, Tilings, and Automata (WT), pp. 441–454.
RTA-1991-Deruyver #equation #first-order #named #proving #theorem proving- EMMY: A Refutational Theorem Prover for First-Order Logic with Equation (AD), pp. 439–441.
VDME-1991-MiddelburgL #comparison- LPF and MPLω — A Logical Comparison of VDM SL and COLD-K (CAM, GRRdL), pp. 279–308.
FPCA-1991-Jensen #analysis #strict- Strictness Analysis in Logical Form (TPJ), pp. 352–366.
KR-1991-BarringerFGH #execution- Meta-Reasoning in Executable Temporal Logic (HB, MF, DMG, AH), pp. 40–49.
KR-1991-Bell - Pragmatic Logics (JB), pp. 50–60.
KR-1991-BrogiT #information management #representation- Metalogic for Knowledge Representation (AB, FT), pp. 61–69.
KR-1991-DelgrandeJ #revisited- Default Logic Revisited (JPD, WKJ), pp. 118–127.
KR-1991-GroveH #multi- Naming and Identity in a Multi-Agent Epistemic Logic (AJG, JYH), pp. 301–312.
KR-1991-Haddawy #probability #representation- A Temporal Probability Logic for Representing Actions (PH), pp. 313–324.
KR-1991-Lamarre - S4 as the Conditional Logic of Nonmonotonicity (PL), pp. 357–367.
KR-1991-MarekST - Modal Nonmonotonic Logics: Ranges, Characterization, Computation (VWM, GFS, MT), pp. 395–404.
KR-1991-Myers #integration- Universal Attachment: An Integration Method for Logic Hybrids (KLM), pp. 405–416.
KR-1991-PagePF #constraints- Generalizing Atoms in Constraint Logic (CDPJ, AMF), pp. 429–440.
KR-1991-PequenoB #consistency #nondeterminism- The Logic of Epistemic Inconsistency (THCP, AB), pp. 453–460.
ECOOP-1991-MorzentiP #composition #object-oriented #specification- An Object-Oriented Logic Language for Modular System Specification (AM, PSP), pp. 39–58.
AdaEurope-1991-Guaspari #automation #specification- Formally Specifying the Logic of an Automatic Guidance Controller (DG), pp. 372–383.
LOPSTR-1991-Huntbach #automation #concurrent- Automated Translation of Occam to a Concurrent Logic Language (MMH), pp. 254–275.
PEPM-1991-Muller #equation #named #semantics- M-LISP: Its Natural Semantics and Equational Logic (RM), pp. 234–242.
PEPM-1991-Wadler #linear #question- Is There a Use for Linear Logic? (PW), pp. 255–273.
PLILP-1991-Antoy #evaluation #lazy evaluation- Lazy Evaluation in Logic (SA), pp. 371–382.
PLILP-1991-BrogiG #constraints #process- Constraints for Synchronizing Logic Coarse-grained Sequential Logic Processes (AB, MG), pp. 407–418.
PLILP-1991-Gloess #order- U-Log, An Ordered Sorted Logic with Typed Attributes (PYG), pp. 275–286.
POPL-1991-AbadiP #composition #refinement- A Logical View of Composition and Refinement (MA, GDP), pp. 323–332.
POPL-1991-KleinmanMPS #communication- Communication with Directed Logic Variables (AK, YM, AP, EYS), pp. 221–232.
WSA-1991-Sun #equation- Equational Logics (YS), pp. 44–52.
DAC-1991-ChewS #multi #simulation- Utilizing Logic Information in Multi-Level Timing Simulation (MPC, AJS), pp. 215–218.
DAC-1991-DeguchiIY #analysis #fault #probability- Probabilistic CTSS: Analysis of Timing Error Probability in Asynchronous Logic Circuits (YD, NI, SY), pp. 650–655.
DAC-1991-Krasniewski #performance #pseudo #synthesis #testing- Logic Synthesis for Efficient Pseudoexhaustive Testability (AK), pp. 66–72.
DAC-1991-LimquecoM #network #optimisation- Logic Optimization of MOS Networks (JCL, SM), pp. 464–469.
DAC-1991-MorganG #synthesis- An ECL Logic Synthesis System (VM, DG), pp. 106–111.
DAC-1991-SoeK #using- Logic Minimization using Two-column Rectangle Replacement (SS, KK), pp. 470–473.
CCPSD-1991-Cardell-Oliver #higher-order #modelling #protocol #realtime #using- Using Higher Order Logic for Modelling Real-Time Protocols (RCO), pp. 259–282.
CCPSD-1991-MeyerW #specification- Actor-Oriented System Specification with Dynamic Logic (JJCM, RJW), pp. 337–357.
CAV-1991-HamaguchiHY #branch #model checking #using #verification- Formal Verification of Speed-Dependent Asynchronous Cicuits Using Symbolic Model Checking of branching Time Regular Temporal Logic (KH, HH, SY), pp. 410–420.
CAV-1991-HiraishiHOY #model checking #verification- Vectorized Symbolic Model Checking of Computation Tree Logic for Sequential Machine Verification (HH, KH, HO, SY), pp. 214–224.
CAV-1991-Jong #approach #automaton- An Automata Theoretic Approach to Temporal Logic (GGdJ), pp. 477–487.
CAV-1991-Nesi #higher-order #induction #process #proving #specification- Mechanizing a Proof by Induction of Process Algebrs Specifications in Higher Order Logic (MN), pp. 288–298.
CAV-1991-NicolaFGR #behaviour #concurrent #framework #verification- An Action Based Framework for Verifying Logical and Behavioural Properties of Concurrent Systems (RDN, AF, SG, GR), pp. 37–47.
CSL-1991-Bosli - Stable Logic (BB), pp. 201–212.
CSL-1991-Fernando #bisimulation #complexity #recursion #set- A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation (TF), pp. 96–110.
CSL-1991-Gradel #on the #transitive- On Transitive Closure Logic (EG), pp. 149–163.
CSL-1991-Hooker - Logical Inference and Polyhedral Projection (JNH), pp. 184–200.
CSL-1991-Lavalette #composition #semantics- Logical Semantics of Modularisation (GRRdL), pp. 306–315.
CSL-1991-Lehmann - Plausibility Logic (DJL), pp. 227–241.
CSL-1991-Mundici #normalisation- Normal Forms in Infinite-Valued Logic: The Case of One Variable (DM), pp. 272–277.
CSL-1991-Oguztuzun #equivalence #first-order- A Fragment of First Order Logic Adequate for Observation Equivalence (HO), pp. 278–292.
CSL-1991-Tyszkiewicz #query #transitive- Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic (JT), pp. 396–410.
ICLP-1991-ChenW #abstraction #multi #set- An Intensional Logic of (Multi-Arity) Set Abstractions (WC, DSW), pp. 97–110.
ICLP-1991-HentenryckD #constraints #logic programming- The Cardinality Operator: A New Logical Connective for Constraint Logic Programming (PVH, YD), pp. 745–759.
ICLP-1991-Miller91a #logic programming #tutorial- Logics for Logic Programming: A Tutorial (DM), p. 911.
ISLP-1991-Benthem #programming #reasoning- Reasoning and Programming: Analogies between Logic and Computation (JvB), pp. 717–718.
ISLP-1991-Meyden #specification- A Clausal Logic for Deontic Action Specification (RvdM), pp. 221–238.
LICS-1991-Aczel - Term Declaration Logic and Generalised Composita (PA), pp. 22–30.
LICS-1991-HungZ #pointer #semantics- Semantics of Pointers, Referencing and Dereferencing with Intensional Logic (HKH, JIZ), pp. 127–136.
LICS-1991-LafontS #game studies #linear #semantics- Games Semantics for Linear Logic (YL, TS), pp. 43–50.
LICS-1991-PeledKP #proving #specification- Specifying and Proving Serializability in Temporal Logic (DP, SK, AP), pp. 232–244.
ECHT-1990-BeeriK #hypermedia #query- A Logical Query Language for Hypertext Systems (CB, YK), pp. 67–80.
PODS-1990-Elkan #database #independence #query- Independence of Logic Database Queries and Updates (CE), pp. 154–160.
VLDB-1990-KuittinenNSS #bottom-up #evaluation #implementation #performance #query- Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries (JK, ON, SS, ESS), pp. 372–379.
GG-1990-Courcelle #graph- The Logical Exprssion of Graph Properties (BC), pp. 38–40.
GG-1990-Courcelle90a #algebra #approach #graph #relational- Graphs as Relational Structures: An Algebraic an Logical Approach (BC), pp. 238–252.
GG-1990-Engelfriet #graph #higher-order #monad- A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees (JE), pp. 311–327.
SIGIR-1990-ChiaramellaN #approach #modelling #retrieval- A Retrieval Model Based on an Extended Modal Logic and its Application to the RIME Experimental Approach (YC, JYN), pp. 25–43.
OOPSLA-ECOOP-1990-Meseguer #concurrent- A Logical Theory of Concurrent Objects (JM), pp. 101–115.
ALP-1990-BronsardR #axiom #functional- Axiomatization of a Functional Logic Language (FB, USR), pp. 101–116.
PLILP-1990-LimM #implementation- Implementing a Meta-Logical Scheme (PL, DNM), pp. 106–120.
ICSE-1990-CostaCB #animation- Logical Animation (MCC, JC, JB), pp. 144–149.
DAC-1990-Chan #algorithm- Algorithms for Library-Specific Sizing of Combinational Logic (PKC), pp. 353–356.
DAC-1990-DevadasK #optimisation #robust #synthesis- Synthesis and Optimization Procedures for Robustly Delay-Fault Testable Combinational Logic Circuits (SD, KK), pp. 221–227.
DAC-1990-Fishburn #heuristic #how- A Depth-Decreasing Heuristic for Combinational Logic: Or How To Convert a Ripple-Carry Adder Into A Carry-Lookahead Adder Or Anything in-between (JPF), pp. 361–364.
DAC-1990-GhoshDN90a #generative #testing- Sequential Test Generation at the Register-Transfer and Logic Levels (AG, SD, ARN), pp. 580–586.
DAC-1990-JustASS #generative #named- PALACE: A Kayout Generator for SCVS Logic Blocks (KMJ, EA, WLS, AS), pp. 468–473.
DAC-1990-KageyamaMS #algorithm #approach #linear #optimisation #programming- Logic Optimization Algorithm by Linear Programming Approach (NK, CM, TS), pp. 345–348.
DAC-1990-MalikBNS #multi- Reduced Offsets for Two-Level Multi-Valued Logic Minimization (AAM, RKB, ARN, ALSV), pp. 290–296.
DAC-1990-MurgaiNSBS #array #programmable #synthesis- Logic Synthesis for Programmable Gate Arrays (RM, YN, NVS, RKB, ALSV), pp. 620–625.
DAC-1990-ParkM #generative #performance #testing- An Efficient Delay Test Generation System for Combinational Logic Circuits (ESP, MRM), pp. 522–528.
DAC-1990-SubramanianZ #distributed #parallel #simulation- Distributed and Parallel Demand Driven Logic Simulation (KS, MRZ), pp. 485–490.
DAC-1990-WangM #named #simulation- LECSIM: A Levelized Event Driven Compiled Logic Simulation (ZW, PMM), pp. 491–496.
PPoPP-1990-AmbriolaCD #design #distributed #implementation #parallel #prolog- Design and Distributed Implementation of the Parallel Logic Language Shared Prolog (VA, PC, MD), pp. 40–49.
ESOP-1990-KuchenLMR #functional #graph #implementation- Graph-based Implementation of a Functional Logic Langugage (HK, RL, JJMN, MRA), pp. 271–290.
ESOP-1990-SchnoebelenP #on the- On the Weak Adequacy of Branching-Time Remporal Logic (PS, SP), pp. 377–388.
ESOP-1990-Voronkov #formal method #programming #towards- Towards the Theory of Programming in Constructive Logic (AV), pp. 421–435.
CADE-1990-BoyerM #proving #theorem proving- A Theorem Prover for a Computational Logic (RSB, JSM), pp. 1–15.
CADE-1990-CostaHLS #automation #implementation #proving #theorem proving- Automatic Theorem Proving in Paraconsistent Logics: Theory and Implementation (NCAdC, LJH, JJL, VSS), pp. 72–86.
CADE-1990-OhlbachH #compilation #tutorial- Tutorial on Compilation techniques for Logics (HJO, AH), p. 683.
CADE-1990-PritchardS #modelling #tutorial- Tutorial on Computing Models of Propositional Logics (PP, JKS), p. 685.
CADE-1990-Schwind #decidability #proving #set #theorem proving- A Tableau-Based Theorem Prover for a Decidable Subset of Default Logic (CS), pp. 528–542.
CADE-1990-Tuominen #framework #proving #theorem proving- Dynamic Logic as a Uniform Framework for Theorem Proving in Intensional Logic (HT), pp. 514–527.
CADE-1990-Voronkov #named- LISS — The Logic Inference Search System (AV), pp. 677–678.
CADE-1990-WosWMOLSB #automation #reasoning- Automated Reasoning Contributed to Mathematics and Logic (LW, SW, WM, RAO, ELL, RLS, RB), pp. 485–499.
CAV-1990-Clarke #explosion #model checking #problem- Temporal Logic Model Checking: Two Techniques for Avoiding the State Explosion Problem (EMC), p. 1.
CAV-1990-HamaguchiHY #branch #complexity #linear #model checking- Branching Time Regular Temporal Logic for Model Checking with Linear Time Complexity (KH, HH, SY), pp. 253–262.
CAV-1990-HiraishiMH #model checking- Vectorized Model Checking for Computation Tree Logic (HH, SM, KH), pp. 44–53.
CAV-1990-LoewensteinD #higher-order #multi #protocol #simulation #using #verification- Verification of a Multiprocessor Cache Protocol Using Simulation Relations and Higher-Order Logic (PL, DLD), pp. 302–311.
CAV-1990-NakamuraKFT #using #verification- A Data Path Verifier for Register Transfer Level Using Temporal Logic Language Tokio (HN, YK, MF, HT), pp. 76–85.
CLP-1990-AndreoliP90 #inheritance #linear #process- Linear Objects in a Logic Processes with Built-in Inheritance (JMA, RP), pp. 495–510.
CLP-1990-BoscoCMPS90 #architecture #distributed #functional #memory management- Logic and Functional Programmin on Distributed Memory Architectures (PGB, CC, CM, MP, GS), pp. 325–339.
CLP-1990-ChengER90 #functional #on the #programming- On Warren’s Method for Functional Programming in Logic (MHMC, MHvE, BER), pp. 546–560.
CLP-1990-LauP90 #first-order #recursion #specification #synthesis #top-down- Top-down Synthesis of Recursive Logic Procedures from First-order Logic Specifications (KKL, SDP), pp. 667–684.
CLP-1990-SawamuraMYO90 #approach #logic programming #proving #specification- A Logic Programming Approach to Specifying Logics and Constructing Proofs (HS, TM, KY, KO), pp. 405–424.
CLP-1990-ShmueliT90a #source code- Logical Diagnosis of LDL Programs (OS, ST), pp. 112–129.
CSL-1990-ArnborgPS #automaton #higher-order #monad- Monadic Second Order Logic, Tree Automata and Forbidden Minors (SA, AP, DS), pp. 1–16.
CSL-1990-Hahnle #multi #performance #proving #towards- Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics (RH), pp. 248–260.
CSL-1990-Huang #dependence- Logics for Belief Dependence (ZH), pp. 274–288.
CSL-1990-Stark #fixpoint #on the- On the Existence of Fixpoints in Moore’s Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle (RFS), pp. 354–365.
LICS-1990-AlurH #complexity #realtime- Real-time Logics: Complexity and Expressiveness (RA, TAH), pp. 390–401.
LICS-1990-HarelLP - Explicit Clock Temporal Logic (EH, OL, AP), pp. 402–413.
LICS-1990-KolaitisV - 0-1 Laws for Infinitary Logics (PGK, MYV), pp. 156–167.
LICS-1990-Lewis - A Logic of Concrete Time Intervals (HRL), pp. 380–389.
LICS-1990-Meyden - The Dynamic Logic of Permission (RvdM), pp. 72–78.
LICS-1990-SekarR #equation #programming- Programming in Equational Logic: Beyond Strong Sequentiality (RCS, IVR), pp. 230–241.
NACLP-1990-Andrews #prolog- The Logical Structure of Sequential Prolog (JHA), pp. 585–602.
NACLP-1990-Barwise #named- Hyperproof: An Excursion in Situated Logic (JB), pp. 779–787.
NACLP-1990-BugliesiLM #partial evaluation- Partial Evaluation for Hierarchies of Logic Theories (MB, EL, PM), pp. 359–376.
NACLP-1990-CodognetCC #abstract interpretation #concurrent- Abstract Interpretation for Concurrent Logic Languages (CC, PC, MMC), pp. 215–232.
NACLP-1990-OzawaHH #garbage collection #generative #parallel- Generation Type Garbage Collection for Parallel Logic Languages (TO, AH, AH), pp. 291–305.
ICALP-1989-Courcelle #equation #graph #higher-order #monad- The Definability of Equational Graphs in Monadic Second-Order Logic (BC), pp. 207–221.
RTA-1989-McNulty #equation- An Equational Logic Sampler (GFM), pp. 234–262.
RTA-1989-MohanS - Negation with Logical Variables in Conditional Rewriting (CKM, MKS), pp. 292–310.
FPCA-1989-RufW #functional #nondeterminism #programming #unification- Nondeterminism and Unification in LogScheme: Integrating Logic and Functional Programming (ER, DW), pp. 327–339.
KR-1989-BacchusTK - A Non-Reified Temporal Logic (FB, JDT, JAGMK), pp. 2–10.
KR-1989-CrawfordK #formal method #information management #representation #towards- Towards a Theory of Access-Limited Logic for Knowledge Representation (JMC, BK), pp. 67–78.
KR-1989-KautzS #problem- Hard Problems for Simple Default Logics (HAK, BS), pp. 189–197.
KR-1989-Lifschitz - Between Circumscription and Autoepistemic Logic (VL), pp. 235–244.
KR-1989-MarekT - Relating Autoepistemic and Default Logics (VWM, MT), pp. 276–288.
KR-1989-Sandewall #difference #equation- Combining Logic and Differential Equations for Describing Real-World Systems (ES), pp. 412–420.
ML-1989-DietzenP #framework #higher-order- Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization (SD, FP), pp. 447–449.
SEKE-1989-HeL #petri net #specification- Deriving Temporal Logic Specifications from Predicate Transition Petri Net (XH, JANL), pp. 116–121.
SIGIR-1989-Rijsbergen #towards- Towards an Information Logic (CJvR), pp. 77–86.
ECOOP-1989-MalenfantLV #named #prolog- ObjVProlog: Metaclasses in Logic (JM, GL, JGV), pp. 257–269.
DAC-1989-AgrawalTD #algorithm #hardware- Algorithms for Accuracy Enhancement in a Hardware Logic Simulator (PA, RT, WJD), pp. 645–648.
DAC-1989-BolsensRCM #analysis #behaviour #debugging- Electrical Debugging of Synchronous MOS VLSI Circuits Exploiting Analysis of the Intended Logic Behaviour (IB, WDR, LJMC, HDM), pp. 513–518.
DAC-1989-Coppola #algorithm #analysis- New Methods in the Analysis of Logic Minimization Data and Algorithms (AJC), pp. 226–231.
DAC-1989-Devadas #multi #synthesis- Approaches to Multi-level Sequential Logic Synthesis (SD), pp. 270–276.
DAC-1989-GoreR #array #automation #equation #programmable #synthesis #using- Automatic Synthesis of Boolean Equations Using Programmable Array Logic (RG, KR), pp. 283–289.
DAC-1989-HwangOI #communication #complexity #multi #synthesis #using- Multi-Level Logic Synthesis Using Communication Complexity (TH, RMO, MJI), pp. 215–220.
DAC-1989-IshiuraTY #behaviour #simulation #verification- Time-Symbolic Simulation for Accurate Timing Verification of Asynchronous Behavior of Logic Circuits (NI, MT, SY), pp. 497–502.
DAC-1989-Keutzer #architecture #design #generative #synthesis- Three Competing Design Methodologies for ASIC’s: Architectual Synthesis, Logic Synthesis, Logic Synthesis and Module Generation (KK), pp. 308–313.
DAC-1989-McGeerB #performance- Efficient Prime Factorization of Logic Expressions (PCM, RKB), pp. 221–225.
DAC-1989-SaldanhaWBS #multi #using- Multi-level Logic Simplification Using Don’t Cares and Filters (AS, ARW, RKB, ALSV), pp. 277–282.
DAC-1989-SouleG #distributed #parallel #simulation- Characterization of Parallelism and Deadlocks in Distributed Digital Logic Simulation (LS, AG), pp. 81–86.
DAC-1989-Tamura #fault #functional- Locating Functional Errors in Logic Circuits (KAT), pp. 185–191.
DAC-1989-VillaS #finite #implementation #named #state machine- NOVA: State Assignment of Finite State Machines for Optimal Two-level Logic Implementations (TV, ALSV), pp. 327–332.
DAC-1989-WangKL #approach #fault #robust #set- A New Approach to Derive Robust Sets for Stuck-open Faults in CMOS Combinational Logic Circuits (JFW, TYK, JYL), pp. 726–729.
DAC-1989-WeinerS #analysis #synthesis- Timing Analysis in a Logic Synthesis Environment (NW, ALSV), pp. 655–661.
SOSP-1989-BurrowsAN #authentication- A Logic of Authentication (MB, MA, RMN), pp. 1–13.
STOC-1989-SafraV #automaton #on the- On ω-Automata and Temporal Logic (SS, MYV), pp. 127–137.
CSL-1989-Borger #prolog #semantics- A Logical Operational Semantics of Full Prolog. Part I: Selection Core and Control (EB), pp. 36–64.
CSL-1989-Gradel #complexity #concept #on the- On Logical Descriptions of Some Concepts in Structural Complexity Theory (EG), pp. 163–175.
CSL-1989-Ohlbach #first-order #multi #proving- New Ways for Developing Proof Theories for First-Order Multi Modal Logics (HJO), pp. 271–308.
CSL-1989-Penczek #branch #concurrent- A Concurrent Branching Time Temporal Logic (WP), pp. 337–354.
LICS-1989-AbiteboulV #first-order #fixpoint- Fixpoint Extensions of First-Order Logic and Datalog-Like Languages (SA, VV), pp. 71–79.
LICS-1989-JagadeesanPP #functional #semantics- A Fully Abstract Semantics for a Functional Language with Logic Variables (RJ, PP, KP), pp. 294–303.
LICS-1989-KiferL #consistency #named #nondeterminism #reasoning- RI: A Logic for Reasoning with Inconsistency (MK, ELL), pp. 253–262.
LICS-1989-NerodeRS - Polynomially Grade Logic I: A Graded Version of System T (AN, JBR, AS), pp. 375–385.
LICS-1989-Pfenning #metaprogramming #named- Elf: A Language for Logic Definition and Verified Metaprogramming (FP), pp. 313–322.
LICS-1989-Scott - Domains and Logics (DSS), pp. 4–5.
LICS-1989-Stolboushkin #bound #complexity- Some Complexity Bounds for Dynamic Logics (APS), pp. 324–332.
NACLP-1989-Bernth #comprehension- Discourse Understanding in Logic (AB), pp. 755–771.
NACLP-1989-BonnerMV #database #query- Expressing Database Queries with Intuitionistic Logic (AJB, LTM, KVV), pp. 831–850.
NACLP-1989-Chau #comparison- Narrowing Grammar: A Comparison with Other Logic Grammars (HLC), pp. 735–754.
NACLP-1989-Nystrom #concurrent #execution- Variable-Free Execution of Concurrent Logic Languages (SON), pp. 536–552.
TAV-1989-Perry - The Logic of Propagation in the Inscape Environment (DP), pp. 114–121.
TAV-1989-RazoukG #realtime #reasoning #source code- Real-Time Interval Logic for Reasoning about Executions of Real-Time Programs (RRR, MMG), pp. 10–19.
PODS-1988-ShmueliTZ #set- Rewriting of Rules Containing Set Terms in a Logic Data Model (LDL) (OS, ST, CZ), pp. 15–28.
SIGMOD-1988-QianW #database #specification #transaction- A Transaction Logic for Database Specification (XQ, RJW), pp. 243–250.
VLDB-1988-Sripada #database #deduction #framework- A logical framework for temporal deductive databases (SMS), pp. 171–182.
VDME-1988-KonikowskaTB #specification #validation- A Three-Valued Logic for Software Specification and Validation (BK, AT, AB), pp. 218–242.
SIGIR-1988-LaineLV #information management- French Textual Information Systems: The Contribution of Extensional and Intensional Logics (SL, OL, IV), pp. 507–518.
ALP-1988-Foret - Rewrite Rule Systems for Modal Propositional Logic (AF), pp. 147–156.
ALP-1988-Pasztor #recursion #semantics #source code #standard- Nonstandard Logics of Recursive Programs and Denotational Semantics (AP), pp. 255–278.
PLILP-1988-AsirelliI #database #development #using- Using Logic Databases in Software Development Environments (PA, PI), pp. 292–299.
PLILP-1988-Lindstrom #functional #source code #static analysis- Static Analysis Of Functional Programs With Logic Variables (GL), pp. 1–19.
DAC-1988-Adler #simulation- A Dynamically-Directed Switch Model for MOS Logic Simulation (DA), pp. 506–511.
DAC-1988-Boehner #automation #named- LOGEX — an Automatic Logic Extractor Form Transistor to Gate Level for CMOS Technology (MB), pp. 517–522.
DAC-1988-Hansen #compilation #hardware #simulation- Hardware Logic Simulation by Compilation (CH), pp. 712–716.
DAC-1988-KazamaKNM #algorithm #evaluation #performance #simulation- Algorithm for Vectorizing Logic Simulation and Evaluation of “VELVET” Performance (YK, YK, MN, HM), pp. 231–236.
DAC-1988-LiRS #on the- On Path Selection in Combinational Logic Circuits (WNL, SMR, SS), pp. 142–147.
DAC-1988-SaitohINKMHHK #simulation #using- Logic Simulation System Using Simulation Processor (SP) (MS, KI, AN, MK, JM, HH, FH, NK), pp. 225–230.
DAC-1988-ShiraishiSKTS #generative- A High Packing Density Module Generator for CMOS Logic Cells (YS, JS, MK, AT, TS), pp. 439–444.
DAC-1988-SouleB #parallel #simulation- Parallel Logic Simulation on General Purpose Machines (LS, TB), pp. 166–171.
DAC-1988-Stroud #approach #automation #synthesis- An Automated BIST Approach for General Sequential Logic Synthesis (CES), pp. 3–8.
DAC-1988-WolfKA #algorithm #kernel #multi- A Kernel-Finding State Assignment Algorithm for Multi-Level Logic (WW, KK, JA), pp. 433–438.
DAC-1988-ZandenG #architecture #named- MILO: A Microarchitecture and Logic Optimizer (NVZ, DG), pp. 403–408.
ESOP-1988-BertDEDDSW #functional #named #programming language- LPG: A Generic, Logic and Functional Programming Language (DB, PD, RE, OD, DD, PYS, FW), pp. 376–377.
CADE-1988-AabyN - Propositional Temporal Interval Logic is PSPACE Complete (AAA, KTN), pp. 218–237.
CADE-1988-BesnardS #automation #reasoning- Supposition-Based Logic for Automated Nonmontonic Reasoning (PB, PS), pp. 592–601.
CADE-1988-BrownP #named #proving #theorem proving- SYMEVAL: A Theorem Prover Based on the Experimental Logic (FMB, SSP), pp. 756–757.
CADE-1988-MalkinM #generative #matrix #testing- Logical Matrix Generation and Testing (PKM, EPM), pp. 685–693.
CADE-1988-McRobbieMT #automation #knowledge-based #performance #proving #standard #theorem proving #towards- Towards Efficient “Knowledge-Based” Automated Theorem Proving for Non-Standard Logics (MAM, RKM, PBT), pp. 197–217.
CADE-1988-Niemela - Decision Procedure for Autoepistemic Logic (IN), pp. 675–684.
CADE-1988-Ohlbach #calculus- A Resolution Calculus for Modal Logics (HJO), pp. 500–516.
CADE-1988-WosM #automation #challenge #combinator #problem #similarity #source code- Challenge Problems Focusing on Equality and Combinatory Logic: Evaluating Automated Theorem-Proving Programs (LW, WM), pp. 714–729.
CSL-1988-DaneluttoM #approach #concurrent #finite- A temporal Logic Approach to Specify and to Prove Properties of Finite State Concurrent Systems (MD, AM), pp. 63–79.
CSL-1988-Lippert - Interval Temporal Logic and Star-Free Expressions (DL), pp. 187–198.
CSL-1988-Niemela #complexity #on the #problem- On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic (IN), pp. 226–239.
CSL-1988-Paech - Gentzen-Systems for Propositional Temporal Logics (BP), pp. 240–253.
CSL-1988-SaakeL #database #specification #using- Using Finite-Linear Temporal Logic for Specifying Database Dynamics (GS, UWL), pp. 288–300.
CSL-1988-Wagner #automaton #on the #problem #source code- On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs (HW), pp. 384–399.
JICSCP-1988-Abdallah88 #heuristic #process- Heuristic Logic and the Process of Discovery (MANA), pp. 859–875.
JICSCP-1988-AllenS88 #multi #question- Multiple Interpretations of the Logical Structure of Legal Rules: Impediment or Boon to Legal Expert Systems? (LEA, CSS), pp. 1609–1623.
JICSCP-1988-BoscoCM88 #functional #power of #programming- Exploiting the Full Power of Logic Plus Functional Programming (PGB, CC, CM), pp. 3–17.
JICSCP-1988-Conery88 - Logical Objects (JSC), pp. 420–434.
JICSCP-1988-FalaschiLMP88 #declarative #semantics- A New Declarative Semantics for Logic Languages (MF, GL, MM, CP), pp. 993–1005.
JICSCP-1988-GallierI88 #equation #order- Rewriting in Order-sorted Equational Logic (JHG, TI), pp. 280–294.
JICSCP-1988-RamanS88 #distributed #execution #problem- Fully Distributed, AND/OR-Parallel Execution of Logic Problems (PR, EWS), pp. 1188–1203.
JICSCP-1988-Saraswat88 - A Somewhat Logical Formulation of CLP Synchronisation Primitives (VAS), pp. 1298–1314.
JICSCP-1988-TrehanW88 #commit #nondeterminism #parallel #parsing- A Parallel Chart Parser for the Committed Choice Non-Deterministic Logic Languages (RT, PFW), pp. 212–232.
JICSCP-1988-Zaniolo88 #data-driven #design #implementation- Design and Implementation of a Logic Based Language for Data Intensive Applications (CZ), pp. 1666–1687.
LICS-1988-ComptonL #algebra- An Algebra and a Logic for NC¹ (KJC, CL), pp. 12–21.
LICS-1988-Dam #composition #concurrent- Relevance Logic and Concurrent Composition (MD), pp. 178–185.
LICS-1988-FaginHM #reasoning- A Logic for Reasoning about Probabilities (RF, JYH, NM), pp. 410–421.
LICS-1988-GrabowskiH #effectiveness #hoare #on the- On the Existence of Effective Hoare Logics (MG, HH), pp. 428–435.
LICS-1988-HoareG #correctness- Partial Correctness of C-MOS Switching Circuits: An Exercise in Applied Logic (CARH, MJCG), pp. 28–36.
LICS-1988-KolaitisV #higher-order #problem- 0-1 Laws and Decision Problems for Fragments of Second-Order Logic (PGK, MYV), pp. 2–11.
LICS-1988-LarsenT #process- A Modal Process Logic (KGL, BT), pp. 203–210.
LICS-1988-MullerSS #automaton #decidability #exponential #why- Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time (DEM, AS, PES), pp. 422–427.
PODS-1987-BeeriNRST #database #set- Sets and Negation in a Logic Database Language (LDL1) (CB, SAN, RR, OS, ST), pp. 21–37.
PODS-1987-Marchetti-SpaccamelaPS #analysis #complexity #implementation #query #worst-case- Worst-case Complexity Analysis of Methods for Logic Query Implementation (AMS, AP, DS), pp. 294–301.
PODS-1987-Shmueli #decidability #query- Decidability and Expressiveness of Logic Queries (OS), pp. 237–249.
PODS-1987-YuanO #database #design #relational- Logical Design of Relational Database Systems (LYY, ZMÖ), pp. 38–47.
SIGMOD-1987-AlyO #database #deduction #modelling #nondeterminism #query- Non-deterministic Modelling of Logical Queries in Deductive Databases (HA, ZMÖ), pp. 60–72.
SIGMOD-1987-SegevS #modelling- Logical Modeling of Temporal Data (AS, AS), pp. 454–466.
VLDB-1987-WhangN #approach #normalisation #optimisation #query #recursion- An Extended Disjunctive Normal Form Approach for Optimizing Recursive Logic Queries in Loosely Coupled Environments (KYW, SBN), pp. 275–287.
ICALP-1987-HaferT #monad #quantifier- Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree (TH, WT), pp. 269–279.
ICALP-1987-LodayaT #subclass- A Modal Logic for a Subclass of Event Structures (KL, PST), pp. 290–303.
OOPSLA-1987-GrossmanE #composition #interface #object-oriented- Logical Composition of Object-Oriented Interfaces (MG, RKE), pp. 295–306.
POPL-1987-MoshierR #data type- A Logic for Partially Specified Data Structures (MDM, WCR), pp. 156–167.
ESEC-1987-AsirelliI #approach #development- Enhancing Configuration Facilities in Software Development: A Logic Approach (PA, PI), pp. 55–63.
DAC-1987-CanrightH - Reflections of High Speed Signals Analyzed as a Delay in Timing for Clocked Logic (REC, ARH), pp. 133–139.
DAC-1987-HealeyK #generative #network- Abstract Routing of Logic Networks for Custom Module Generation (STH, WJK), pp. 230–236.
DAC-1987-HofmannK #optimisation- Delay Optimization of Combinational Static CMOS Logic (MH, JKK), pp. 125–132.
DAC-1987-LiuSU #array #design #named #programmable #scalability #self- BIST-PLA: A Built-in Self-Test Design of Large Programmable Logic Arrays (CYL, KKS, SJU), pp. 385–391.
DAC-1987-MaDSW #algorithm #implementation #parallel #verification- Logic Verification Algorithms and Their Parallel Implementation (HKTM, SD, ALSV, RW), pp. 283–290.
DAC-1987-Trevillyan #overview #synthesis- An Overview of Logic Synthesis Systems (LT), pp. 166–172.
DAC-1987-Wey #array #design #on the #programmable- On Yield Consideration for the Design of Redundant Programmable Logic Arrays (CLW), pp. 622–628.
AF-1987-GoguenM #modelling #programming #similarity- Models and Equality for Logical Programming (JAG, JM), pp. 1–22.
CAAP-1987-BrowneCG - Characterizing Kripke Structures in Temporal Logic (MCB, EMC, OG), pp. 256–270.
CFLP-1987-GirardL #lazy evaluation #linear- Linear Logic and Lazy Computation (JYG, YL), pp. 52–66.
CFLP-1987-Piperno #abstraction #algorithm #combinator- A Compositive Abstraction Algorithm for Combinatory Logic (AP), pp. 39–51.
CSL-1987-HeiselRS #using #verification- Program Verification Using Dynamic Logic (MH, WR, WS), pp. 102–117.
CSL-1987-Lowen #aspect-oriented #optimisation- Optimization Aspects of Logical Formulas (UL), pp. 173–187.
CSL-1987-Rasiowa #approximate #reasoning- Logic of Approximation Reasoning (HR), pp. 188–210.
CSL-1987-Schonfeld - Interfacing a Logic Machine (WS), pp. 263–272.
ICLP-1987-Foster87 #design #operating system- Logic Operating System: Design Issues (ITF), pp. 910–926.
ICLP-1987-LeviP87 #approach #declarative #semantics- An Approach to the Declarative Semantics of Synchronization in Logic Languages (GL, CP), pp. 877–893.
ICLP-1987-Maher87 #semantics #source code- Logic Semantics for a Class of Committed-Choice Programs (MJM), pp. 858–876.
ICLP-1987-MillerBTL87 - Logical Secrets (MSM, DGB, EDT, JL), pp. 704–728.
ICLP-1987-Pereira87 - Grammars and Logics of Partial Information (FCNP), pp. 989–1013.
ICLP-1987-SaccaZ87 #implementation #query #recursion- Implementation of Recursive Queries for a Data Language Based on Pure Horn Logic (DS, CZ), pp. 104–135.
ICLP-1987-Sato87 #concurrent #named- Quty: A Concurrent Language Based on Logic and Function (MS), pp. 1034–1056.
LICS-1987-Abramsky - Domain Theory in Logical Form (SA), pp. 47–53.
LICS-1987-Emden #first-order #functional #programming #relational- First-order Predicate Logic as a Common Basis for Relational and Functional Programming (MHvE), p. 179.
LICS-1987-Goerdt #hoare #imperative- Hoare Logic for λ-Terms as Basis of Hoare Logic for Imperative Languages (AG), pp. 293–299.
LICS-1987-HarperHP #framework- A Framework for Defining Logics (RH, FH, GDP), pp. 194–204.
LICS-1987-Shoham #approach #semantics- A Semantical Approach to Nonmonotic Logics (YS), pp. 275–279.
LICS-1987-SistlaZ #on the- On the Eventuality Operator in Temporal Logic (APS, LDZ), pp. 153–166.
LICS-1987-Thomas #first-order #infinity #on the- On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees (WT), pp. 245–256.
SLP-1987-Ait-KaciLN87 #equation- Le Fun: Logic, Equations and Functions (HAK, PL, RN), pp. 17–23.
SLP-1987-Chen87 #formal method #higher-order- A Theory of Modules Based on Second-Order Logic (WC), pp. 24–33.
SLP-1987-LeviPBGM87 #semantics- A Complete Semantic Characterization of K-Leaf: A Logic Language with Partial Functions (GL, CP, PGB, EG, CM), pp. 318–327.
SLP-1987-Mozes87 #database #deduction- A Deductive Database Based on Aristotelian Logic (EM), pp. 244–252.
SLP-1987-ShinNHM87 #canonical #functional #unification- A Functional Logic Language Based on Canonical Unification (DWS, JHN, SH, SM), pp. 328–334.
PODS-1986-SaccaZ #database #implementation #on the #query- On the Implementation of a Simple Class of Logic Queries for Databases (DS, CZ), pp. 16–23.
PODS-1986-Wilkins #approach #database- A Model-Theoretic Approach to Updating Logical Databases (MW), pp. 224–234.
SIGMOD-1986-Gelder #evaluation #framework #message passing #query- A Message Passing Framework for Logical Query Evaluation (AVG), pp. 155–165.
VLDB-1986-BryM #consistency #constraints #database- Checking Consistency of Database Constraints: a Logical Basis (FB, RM), pp. 13–20.
VLDB-1986-CeriGL #algebra #approach #optimisation #query- Translation and Optimization of Logic Queries: The Algebraic Approach (SC, GG, LL), pp. 395–402.
VLDB-1986-UdagawaM #database #relational- An Extended Relational Database System and It’s Application to Management of Logic Diagrama (YU, TM), pp. 267–277.
VLDB-1986-Yokomori #database #on the #query- On Analogical Query Processing in Logic Database (TY), pp. 376–383.
ICALP-1986-Stirling #composition #concurrent #correctness- A Compositional Reformulation of Owicki-Gries’s Partial Correctness Logic for a Concurrent While Language (CS), pp. 407–415.
POPL-1986-Ait-KaciN #inheritance- Logic and Inheritance (HAK, RN), pp. 219–228.
POPL-1986-BarringerKP #concurrent- A Really Abstract Concurrent Model and its Temporal Logic (HB, RK, AP), pp. 173–183.
POPL-1986-RamakrishnanS #distributed #programming- Annotations for Distributed Programming in Logic (RR, AS), pp. 255–262.
POPL-1986-Wolper #source code- Expressing Interesting Properties of Programs in Propositional Temporal Logic (PW), pp. 184–193.
DAC-1986-BapatV #reasoning #using- Reasoning about digital systems using temporal logic (SB, GV), pp. 215–219.
DAC-1986-Gerveshi #comparison- Comparison of CMOS PLA and polycell representations of control logic (CMG), pp. 638–642.
DAC-1986-Geus #automation #benchmark #design #metric #optimisation #synthesis- Logic synthesis and optimization benchmarks for the 1986 Design Automation Conference (AJdG), p. 78.
DAC-1986-GregoryBGH #automation #named #optimisation- SOCRATES: a system for automatically synthesizing and optimizing combinational logic (DG, KAB, AJdG, GDH), pp. 79–85.
DAC-1986-JoynerTBNG #adaptation #synthesis- Technology adaption in logic synthesis (WHJJ, LT, DB, TAN, SCG), pp. 94–100.
DAC-1986-KishidaSIIH - A delay test system for high speed logic LSI’s (KK, FS, YI, SI, TH), pp. 786–790.
DAC-1986-MiyoshiOSOA #design #scalability #simulation- An extensive logic simulation method of very large scale computer design (MM, YO, AS, NO, NA), pp. 360–365.
DAC-1986-OdawaraTOOZ #comparison #verification- A logic verifier based on Boolean comparison (GO, MT, OO, TO, ZqZ), pp. 208–214.
DAC-1986-SaitoSYK #array #rule-based #synthesis- A rule-based logic circuit synthesis system for CMOS gate arrays (TS, HS, MY, NK), pp. 594–600.
DAC-1986-ShinshaKSKI #identification #incremental #synthesis- Incremental logic synthesis through gate logic structure identification (TS, TK, YS, JK, KI), pp. 391–397.
DAC-1986-Smith #parallel #simulation- Fundamentals of parallel logic simulation (RJSI), pp. 2–12.
DAC-1986-TakasakiSNIK #hardware #simulation- HAL II: a mixed level hardware logic simulation system (ST, TS, NN, HI, NK), pp. 581–587.
DAC-1986-TsuchiyaMITMY #design #scalability- Establishment of higher level logic design for very large scale computer (YT, MM, YI, ET, TM, TY), pp. 366–371.
DAC-1986-WatanabeMNH #generative #knowledge-based- Knowledge-based optimal IIL generator from conventional logic circuit descriptions (TW, TM, TN, NH), pp. 608–614.
DAC-1986-WongFCS #simulation #statistics- Statistics on logic simulation (KFW, MAF, RDC, BLS), pp. 13–19.
ESOP-1986-BertE #design #functional #implementation #programming language- Design and Implementation of a Generic, Logic and Functional Programming Language (DB, RE), pp. 119–132.
CADE-1986-Andrews #higher-order- Connections and Higher-Order Logic (PBA), pp. 1–4.
CADE-1986-BoyerM #overview- Overview of a Theorem-Prover for A Computational Logic (RSB, JSM), pp. 675–678.
CADE-1986-Dietrich #algebra- Relating Resolution and Algebraic Completion for Horn Logic (RD), pp. 62–78.
CADE-1986-HahnleHRS #interactive #verification- An Interactive Verification System Based on Dynamic Logic (RH, MH, WR, WS), pp. 306–315.
CADE-1986-HannaD #functional #implementation- Purely Functional Implementation of a Logic (FKH, ND), pp. 598–607.
CADE-1986-Jager #analysis- Some Contributions to the Logical Analysis of Circumscrition (GJ), pp. 154–171.
CADE-1986-Konolige #quantifier- Resolution and Quantified Epistemic Logics (KK), pp. 199–208.
CADE-1986-MannaW #how- How to Clear a Block: Plan Formation in Situational Logic (ZM, RJW), pp. 622–640.
CADE-1986-Schmitt #aspect-oriented- Computational Aspects of Three-Valued Logic (PHS), pp. 190–198.
CADE-1986-Weispfenning #recursion #source code- Diamond Formulas in the Dynamic Logic of Recursively Enumerable Programs (VW), pp. 564–571.
ICLP-1986-Abramson86 #concurrent- Sequential and Concurrent Deterministic Logic Grammars (HA), pp. 389–395.
ICLP-1986-Haynes86 #continuation- Logic Continuations (CTH), pp. 671–685.
ICLP-1986-YangA86 #named #parallel #prolog- P-Prolog: A Parallel Logic Language Based on Exclusive Relation (RY, HA), pp. 255–269.
LICS-1986-Browne #algorithm #automation #finite #using #verification- An Improved Algorithm for the Automatic Verification of Finite State Systems Using Temporal Logic (MCB), pp. 260–266.
LICS-1986-CoppoZ #type inference- Type inference and logical relations (MC, MZ), pp. 218–226.
LICS-1986-HalpernS - A Propositional Model Logic of Time Intervals (JYH, YS), pp. 279–292.
LICS-1986-Meyer #hoare #semantics- Floyd-Hoare Logic Defines Semantics: Preliminary Version (ARM), pp. 44–48.
LICS-1986-RosnerP - A Choppy Logic (RR, AP), pp. 306–313.
LICS-1986-RoundsK #calculus #representation- A Complete Logical Calculus for Record Structures Representing Linguistic Information (WCR, RTK), pp. 38–43.
SLP-1986-FosterK86 - A Logical Treatment of Secondary Storage (ITF, AJK), pp. 58–67.
PODS-1985-Vardi #database #query- Querying Logical Databases (MYV), pp. 57–65.
SIGMOD-1985-KuperV #on the #power of- On the Expressive Power of the Logical Data Model (GMK, MYV), pp. 180–187.
SIGMOD-1985-Ullman #database #implementation #query- Implementation of Logical Query Languages for Databases (JDU), p. 444.
ICALP-1985-Curien #category theory #combinator- Categorical Combinatory Logic (PLC), pp. 130–139.
ICALP-1985-Hortala-GonzalezR #hoare #nondeterminism #source code #standard #theorem- Hoare’s Logic for Nondeterministic Regular Programs: A Nonstandard Completeness Theorem (MTHG, MRA), pp. 270–280.
ICALP-1985-Pnueli #branch #linear #semantics- Linear and Branching Structures in the Semantics and Logics of Reactive Systems (AP), pp. 15–32.
ICALP-1985-SistlaVW #automaton #problem- The Complementation Problem for Büchi Automata with Applications to Temporal Logic (APS, MYV, PW), pp. 465–474.
FPCA-1985-Dybjer85 #verification- Program Verification in a Logical Theory of Constructions (PD), pp. 334–349.
POPL-1985-Leivant #imperative #reasoning #source code- Logical and Mathematical Reasoning about Imperative Programs (DL), pp. 132–140.
POPL-1985-Lindstrom #functional #programming- Functional Programming and the Logical Variable (GL), pp. 266–280.
DAC-1985-DagenaisAR - The McBOOLE logic minimizer (MD, VKA, NCR), pp. 667–673.
DAC-1985-HealeyG #composition #network- Decomposition of logic networks into silicon (STH, DDG), pp. 162–168.
DAC-1985-LaarhovenAD #algorithm- PHIPLA-a new algorithm for logic minimization (PJMvL, EHLA, MD), pp. 739–743.
DAC-1985-MiyoshiKTNA #simulation- Speed up techniques of logic simulation (MM, YK, OT, YN, NA), pp. 812–815.
DAC-1985-RowenH #flexibility #implementation #named- SWAMI: a flexible logic implementation system (CR, JLH), pp. 169–175.
CAAP-1985-Curien #combinator- Typed Categorial Combinatory Logic (PLC), pp. 157–172.
STOC-1985-FaginV #semantics- An Internal Semantics for Modal Logic: Preliminary Report (RF, MYV), pp. 305–315.
STOC-1985-Peleg #concurrent- Concurrent Dynamic Logic (DP), pp. 232–239.
STOC-1985-VardiS #bound #source code- Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report (MYV, LJS), pp. 240–251.
SLP-1985-LeviP85 #declarative #semantics- The Declarative Semantics of Logical Read-Only Variables (GL, CP), pp. 128–137.
SLP-1985-Narain85 #evaluation #lazy evaluation- A Technique for Doing Lazy Evaluation in Logic (SN), pp. 261–269.
SLP-1985-SrivastavaOS85 #functional #integration #programming- An(other) Integration of Logic and Functional Programming (AS, DO, AS), pp. 254–260.
SLP-1985-UmrigarP85 #empirical #first-order #programming- An Experiment in Programming with Full First-Order Logic (ZDU, VP), pp. 40–47.
PODS-1984-KuperUV #database #equivalence #on the- On the Equivalence of Logical Databases (GMK, JDU, MYV), pp. 221–228.
PODS-1984-KuperV #approach #database- A New Approach to Database Logic (GMK, MYV), pp. 86–96.
SIGMOD-1984-Hall #algebra #functional #programming #relational- Relational Algebras, Logic, and Functional Programming (PAVH), pp. 326–333.
SIGMOD-1984-Salton #information retrieval #using- The Use of Extended Boolean Logic in Information Retrieval (GS), pp. 277–285.
VLDB-1984-JooPM #data analysis #database #design #named- Datadict — A Data Analysis and Logical Database Design Tool (TTJ, TKP, GAM), pp. 71–77.
POPL-1984-Grabowski #on the #programming- On Relative Completeness of Programming Logics (MG), pp. 258–261.
ICSE-1984-ToriiMSK #analysis #functional #problem #programming- Functional Programming and Logical Programming for the Telegram Analysis Problem (KT, YM, YS, TK), pp. 463–472.
DAC-1984-AlaliDM - A model for non interpreted structures of logical systems (RA, CD, JJM), pp. 258–264.
DAC-1984-DoshiSS #interactive #multi- THEMIS logic simulator — a mix mode, multi-level, hierarchical, interactive digital circuit simulator (MHD, RBS, DMS), pp. 24–31.
DAC-1984-GlazierA #hardware #named #simulation- Ultimate: A hardware logic simulation engine (MEG, APA), pp. 336–342.
DAC-1984-KozawaMT #algorithm #layout #top-down- Combine and top down block placement algorithm for hierarchical logic VLSI layout (TK, CM, HT), pp. 667–669.
DAC-1984-ReddyAJ #detection #fault- A gate level model for CMOS combinational logic circuits with application to fault detection (SMR, VDA, SKJ), pp. 504–509.
DAC-1984-SastryP #on the #slicing- On the relation between wire length distributions and placement of logic on master slice ICs (SS, ACP), pp. 710–711.
DAC-1984-ShinshaKHAI #algorithm #named #synthesis- Polaris: Polarity propagation algorithm for combinational logic synthesis (TS, TK, MH, KA, KI), pp. 322–328.
DAC-1984-TakahashiKYEF #network #simulation- An MOS digital network model on a modified thevenin equivalent for logic simulation (TT, SK, OY, KE, HF), pp. 549–555.
STOC-1984-BarringerKP #specification- Now You May Compose Temporal Logic Specifications (HB, RK, AP), pp. 51–63.
STOC-1984-EmersonS #branch- Deciding Branching Time Logic (EAE, APS), pp. 14–24.
STOC-1984-Gerth #composition #how- Transition Logic: How to Reason About Temporal Properties in a Compositional Way (RG), pp. 39–50.
STOC-1984-HartS #bound #finite #modelling #probability- Probabilistic Temporal Logics for Finite and Bounded Models (SH, MS), pp. 1–13.
STOC-1984-Kozen #equation- Pebblings, Edgings, and Equational Logic (DK), pp. 428–435.
STOC-1984-VardiW #automaton #source code- Automata Theoretic Techniques for Modal Logics of Programs (MYV, PW), pp. 446–456.
CADE-1984-CavalliC #linear- A Decision Method for Linear Temporal Logic (ARC, LFdC), pp. 113–127.
CADE-1984-OhlbachW #automation #problem #proving #theorem proving- Solving a Problem in Relevance Logic with an Automated Theorem Prover (HJO, GW), pp. 496–508.
ILPC-1984-BoscoGG84 #concurrent #process #prolog #specification #verification- A Prolog System for the Verification of Concurrent Processes Against Temporal Logic Specifications (PGB, GG, EG), pp. 219–229.
ILPC-1984-CrammondM84 #architecture #parallel- An Architecture for Parallel Logic Languages (JAC, CDFM), pp. 183–194.
ILPC-1984-EmdenL84 #prolog #re-engineering- A Logical Reconstruction of Prolog II (MHvE, JWL), pp. 35–40.
ILPC-1984-Sterling84 #problem- Logical Levels of Problem Solving (LS), pp. 231–242.
SLP-1984-BroughE84 #data flow #programming- Dataflow, Flowcharts, and “LUCID”-style Programming in Logic (DRB, MHvE), pp. 252–258.
SLP-1984-MiyachiKKFTY84 #database- A Knowledge Assimilation Method for Logic Databases (TM, SK, HK, KF, AT, HY), pp. 118–125.
SLP-1984-UeharaOKT84 #bottom-up #implementation #overview #parsing- A Bottom-Up Parser Based on Predicate Logic: A Survey of the Formalism and its Implementation Technique (KU, RO, OK, JT), pp. 220–227.
VLDB-1983-BrownP #design #named- LAURA: A Formal Data Model and her Logical Design Methodology (RB, DSPJ), pp. 206–218.
VLDB-1983-StockerC - A Target Logical Schema: The ACS (PMS, RC), pp. 309–310.
ICALP-1983-AptD #axiom #using- An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (KRA, CD), pp. 15–27.
ICALP-1983-BrookesR #behaviour #equivalence #programming- Behavioural Equivalence Relations Induced by Programming Logics (SDB, WCR), pp. 97–108.
ICALP-1983-ReifS #multi #network- A Multiprocess Network Logic with Temporal and Spatial Modalities (JHR, APS), pp. 629–639.
POPL-1983-ClarkeES #approach #automation #concurrent #finite #specification #using #verification- Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach (EMC, EAE, APS), pp. 117–126.
DAC-1983-BarzilaiHSTW #simulation #using- Simulating pass transistor circuits using logic simulation machines (ZB, LMH, GMS, DTT, LSW), pp. 157–163.
DAC-1983-ChiangV #detection #fault #network #on the- On fault detection in CMOS logic networks (KWC, ZGV), pp. 50–56.
DAC-1983-FlakeMM #algebra #simulation- An algebra for logic strength simulation (PF, PM, GM), pp. 615–618.
DAC-1983-HuK #array #programmable #reduction- Optimum reduction of programmable logic array (TCH, YSK), pp. 553–558.
DAC-1983-JordanP #interactive #named- ILS — interactive logic simulator (GDJ, BBP), pp. 719–720.
DAC-1983-MicheliS #array #multi #named #programmable- PLEASURE: a computer program for simple/multiple constrained/unconstrained folding of Programmable Logic Arrays (GDM, ALSV), pp. 530–537.
DAC-1983-RubinH #design- A logic design front-end for improved engineering productivity (FR, PWH), pp. 239–245.
DAC-1983-SangsterM #named #simulation- Aquarius: Logic simulation on an Engineering Workstation (AS, JM), pp. 93–99.
DAC-1983-SasakiKOT #hardware #named- HAL: A block level HArdware Logic simulator (TS, NK, KO, KT), pp. 150–156.
DAC-1983-StevensA #multi- BIMOS, an MOS oriented multi-level logic simulator (PS, GA), pp. 100–106.
STOC-1983-Feldman #decidability #probability- A Decidable Propositional Probabilistic Dynamic Logic (YAF), pp. 298–309.
STOC-1983-HalpernR - A Logic to Reason about Likelihood (JYH, MOR), pp. 310–319.
STOC-1983-Olderog #hoare #source code- A Characterization of Hoare’s Logic for Programs with Pascal-like Procedures (ERO), pp. 320–329.
SIGMOD-1982-MaierRSSW #independence #query #relational #towards- Toward Logical Data Independence: A Relational Query Language Without Relations (DM, DR, SCS, JS, DSW), pp. 51–60.
VLDB-1982-NavatheG #database #design- A Methodology for View Inegration in Logical Database Design (SBN, SGG), pp. 142–164.
ICALP-1982-BermanHT #nondeterminism #on the #power of- On the Power of Nondeterminism in Dynamic Logic (PB, JYH, JT), pp. 48–60.
POPL-1982-Boehm - A Logic for Expressions with Side-Effects (HJB), pp. 268–280.
POPL-1982-ClarkeGH #axiom #effectiveness #hoare #on the- On Effective Axiomatizations of Hoare Logics (EMC, SMG, JYH), pp. 309–321.
POPL-1982-ShermanPH #process- Is the Interesting Part of Process Logic Uninteresting — A Translation from PL to PDL (RS, AP, DH), pp. 347–360.
POPL-1982-Wolper #communication #process #specification #synthesis #using- Specification and Synthesis of Communicating Processes using an Extended Temporal Logic (PW), pp. 20–33.
ICSE-1982-YonezakiK #functional #process #specification- Functional Specification of Synchronized Processes Based on Modal Logic (NY, TK), pp. 208–217.
DAC-1982-AbramoviciLM #simulation- A logic simulation machine (MA, YHL, PRM), pp. 65–73.
DAC-1982-BeningLAS #analysis #network- Developments in logic network path delay analysis (LB, TAL, CRA, JES), pp. 605–615.
DAC-1982-BoseA #array #generative #programmable #testing- Test generation for programmable logic arrays (PB, JAA), pp. 574–580.
DAC-1982-HachtelNS #array #programmable- Techniques for programmable logic array folding (GDH, ARN, ALSV), pp. 147–155.
DAC-1982-HirakawaSM #simulation- Logic simulation for LSI (KH, NS, MM), pp. 755–761.
DAC-1982-KangKL #adaptation #cpu #design #evolution #layout #matrix #random- Gate matrix layout of random control logic in a 32-bit CMOS CPU chip adaptable to evolving logic design (SMK, RHK, HFSL), pp. 170–174.
DAC-1982-KawatoUHS #interactive #synthesis- An interactive logic synthesis system based upon AI techniques (NK, TU, SH, TS), pp. 858–864.
DAC-1982-LarsenLS #equation- Aw expanded logic equation list for checkout (RPL, JAL, AKS), pp. 291–299.
DAC-1982-Leinwand #correctness- Logical correctness by construction (SML), pp. 825–831.
DAC-1982-Pawlak #modelling- Digital logic modeling system based on MODLAN (AP), pp. 763–770.
DAC-1982-SakaiTYOOKKY #design #interactive #simulation- An Interactive Simulation System for structured logic design — ISS (TS, YT, HY, YO, YO, HK, SK, SY), pp. 747–754.
DAC-1982-TeelW #design- A logic minimizer for VLSI PLA design (BT, DW), pp. 156–162.
STOC-1982-EmersonH #branch- Decision Procedures and Expressiveness in the Temporal Logic of Branching Time (EAE, JYH), pp. 169–180.
STOC-1982-FeldmanH #probability- A Probabilistic Dynamic Logic (YAF, DH), pp. 181–195.
STOC-1982-SistlaC #complexity #linear- The Complexity of Propositional Linear Temporal Logics (APS, EMC), pp. 159–168.
CADE-1982-Gabbay - Intuitonistic Basis for Non-Monotonic Logic (DMG), pp. 260–273.
CADE-1982-LuskMO #architecture #kernel- Logic Machine Architecture: Kernel Funtions (ELL, WM, RAO), pp. 70–84.
CADE-1982-LuskMO82a #architecture- Logic Machine Architecture: Inference Mechanisms (ELL, WM, RAO), pp. 85–108.
CADE-1982-ShostakSM #named #specification #verification- STP: A Mechanized Logic for Specification and Verification (RES, RLS, PMMS), pp. 32–49.
ILPC-1982-Bowen82 #concurrent #execution- Concurrent Execution of Logic (KAB), pp. 26–30.
ILPC-1982-ChakravarthyMT82 #database #relational- Interfacing Predicate Logic Languages and Relational Databases (USC, JM, DT), pp. 91–98.
ILPC-1982-Ennals82 #education- Teaching Logic as a Computer Language in Schools (RE), pp. 99–104.
ILPC-1982-Eshghi82 #fault #metalanguage #programming- Application of Meta-language Programming to Fault Finding in Logic Circuits (KE), pp. 240–246.
ILPC-1982-JoubertFFR82 - Medical Decision Aid: Logic Bases of the System SPHINX (MJ, MF, DF, MR), pp. 210–214.
ILPC-1982-Monteiro82 #concurrent #horn clause #specification- A Horn Clause-like Logic for Specifying Concurrency (LM), pp. 1–8.
ILPC-1982-Pereira82 - Logic Control with Logic (LMP), pp. 9–18.
ILPC-1982-Porto82 #named #programming- Epilog: A Language for Extended Programming in Logic (AP), pp. 31–37.
VLDB-1981-Gallaire #database- Impacts of Logic and Databases (HG), pp. 248–259.
VLDB-1981-TanakamK #database #distributed #independence #integration #relational- Logical Integration of Locally Independent Relational Databases into a Distributed Database (KT, YK), pp. 131–141.
VLDB-1981-Warren #database #interactive #performance #query #relational- Efficient Processing of Interactive Relational Data Base Queries expressed in Logic (DHDW), pp. 272–281.
ICALP-1981-Ben-AriHP #finite #modelling- Finite Models for Deterministic Propositional Dynamic Logic (MBA, JYH, AP), pp. 249–263.
ICALP-1981-BergstraT #algebra #hoare #programming- Algebraically Specified Programming Systems and Hoare’s Logic (JAB, JVT), pp. 348–362.
ICALP-1981-Makowsky81a #named #power of- Errata: Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory (JAM), p. 551.
ICALP-1981-MeyerSM #deduction #problem- The Deducibility Problem in Propositional Dynamic Logic (ARM, RSS, GM), pp. 238–248.
ICALP-1981-MoriconiS #automation #generative #hoare #verification- Automatic Construction of Verification Condition Generators From Hoare Logics (MM, RLS), pp. 363–377.
POPL-1981-Ben-AriMP #branch- The Temporal Logic of Branching Time (MBA, ZM, AP), pp. 164–176.
POPL-1981-Pratt #decidability- Program Logic Without Binding is Decidable (VRP), pp. 159–163.
DAC-1981-ArmstrongD #named- GSP: A logic simulator for LSI (JRA, DED), pp. 518–524.
DAC-1981-Berman #comparison #on the- On logic comparison (LB), pp. 854–861.
DAC-1981-GoatesP #array #design #layout #lisp #modelling #named- ABLE: A LISP-based layout modeling language with user-definable procedural models for storage/logic array design (GBG, SSP), pp. 322–329.
DAC-1981-GoelR #automation #generative #named #testing- PODEM-X: An automatic test generation system for VLSI logic structures (PG, BCR), pp. 260–268.
DAC-1981-GoshimaOKMTO #scalability- Diagnostic system for large scale logic cards and LSIs (SG, YO, TK, TM, YT, YO), pp. 256–259.
DAC-1981-HaferP #analysis #design #formal method #specification- A formal method for the specification, analysis, and design of register-transfer level digital logic (LJH, ACP), pp. 846–853.
DAC-1981-HoltH - A MOS/LSI oriented logic simulator (DH, DH), pp. 280–287.
DAC-1981-IshiiIIYK #automation #diagrams #editing #interactive- Automatic input and interactive editing systems of logic circuit diagrams (MI, YI, MI, MY, SK), pp. 639–645.
DAC-1981-Leinwand #process #simulation- Process oriented logic simulation (SML), pp. 511–517.
DAC-1981-LeiveT #synthesis- A technology relative Logic Synthesis and Module Selection system (GWL, DET), pp. 479–485.
DAC-1981-OdawaraKAK #design #interactive #named- PAS-CIP: An interactive logic design system (GO, SK, HA, YK), pp. 443–450.
DAC-1981-RaethALB #functional #modelling #simulation- Functional modelling for logic simulation (PGR, JMA, GBL, JMB), pp. 791–795.
DAC-1981-Ramsay #array #design- A remote design station for customer Uncommitted Logic Array designs (FRR), pp. 498–504.
DAC-1981-Ruehli #analysis #modelling #overview #scalability #simulation- Survey of analysis, simulation and modeling for large scale logic circuits (AER), pp. 124–129.
DAC-1981-SaitoUK #design- A CAD system for logic design based on frames and demons (TS, TU, NK), pp. 451–456.
DAC-1981-Sherwood #modelling #simulation- A MOS modelling technique for 4-state true-value hierarchical logic simulation or Karnough knowledge (WS), pp. 775–785.
DAC-1981-TanakaMNOTK #array #design- An integrated computer aided design system for gate array masterslices: Part 1. Logic reorganization system LORES-2 (CT, SM, SN, TO, MT, KK), pp. 59–65.
SOSP-1981-BernsteinH #proving #realtime #source code- Proving Real-Time Properties of Programs with Temporal Logic (AJB, PKHJ), pp. 1–11.
STOC-1981-ChandraHMP #equation #process- Equations between Regular Terms and an Application to Process Logic (AKC, JYH, ARM, RP), pp. 384–390.
STOC-1981-MullerS #automaton #graph #higher-order #problem #reachability- Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems (DEM, PES), pp. 46–54.
STOC-1981-Streett - Propositional Dynamic Logic of Looping and Converse (RSS), pp. 375–383.
ICALP-1980-Makowsky #power of- Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory (JAM), pp. 409–421.
POPL-1980-Lamport #quote #source code- “Sometime” is Sometimes “Not Never” — On the Temporal Logic of Programs (LL), pp. 174–185.
POPL-1980-Parikh #complexity #modelling #source code- Propositional Logics of Programs: Systems, Models, and Complexity (RP), pp. 186–192.
POPL-1980-ReifP #multi- A Dynamic Logic of Multiprocessing with Incomplete Information (JHR, GLP), pp. 193–202.
DAC-1980-DarringerJ #synthesis- A new look at logic synthesis (JAD, WHJJ), pp. 543–549.
DAC-1980-DukeM #design #named- Alex: A conversational, hierarchical logic design system (KAD, KM), pp. 318–327.
DAC-1980-KoppelmanM #verification- Verifying deep logic hierarchies with ALEX (GMK, KM), pp. 328–335.
DAC-1980-Ramsay #array #automation #design- Automation of design for uncommitted logic array (FRR), pp. 100–107.
DAC-1980-SasakiYKNTN #named #scalability #verification- MIXS: A mixed level simulator for large digital system logic verification (TS, AY, SK, TN, KT, NN), pp. 626–633.
DAC-1980-ShirakawaOHTO #layout #random- A layout system for the random logic portion of MOS LSI (IS, NO, TH, ST, HO), pp. 92–99.
DAC-1980-Shiva #synthesis- Combinational logic synthesis from an HDL description (SGS), pp. 550–555.
DAC-1980-Ulrich #flexibility #performance #simulation- Table lookup techniques for fast and flexible digital logic simulation (EU), pp. 560–563.
STOC-1980-MeyerP - Definability in Dynamic Logic (ARM, RP), pp. 1–7.
STOC-1980-Reif #probability #programming- Logics for Probabilistic Programming (JHR), pp. 8–13.
CADE-1980-Thompson - Logical Support in a Time-Varying Model (AMT), pp. 143–153.
VLDB-1979-Dahl #database #deduction #design #natural language- Logical Design of Deductive Natural Language Consultable Data Bases (VD), pp. 24–31.
VLDB-1979-HouselWY #database #dependence #design #functional- The Functional Dependency Model for Logical Database Design (BCH, VEW, SBY), pp. 194–208.
VLDB-1979-IraniPT #database #design- A Designer for DBMS-Processable Logical Database Structures (KBI, SP, TJT), pp. 219–231.
VLDB-1979-OrenA #concept #database #design #statistics- Statistice for the Usage of a Conceptual Data Model as a Basis for Logical Data Base Design (OO, FA), pp. 140–145.
ICALP-1979-MannaP #source code- The Modal Logic of Programs (ZM, AP), pp. 385–409.
POPL-1979-CartwrightM #first-order #programming- First Order Programming Logic (RC, JM), pp. 68–80.
POPL-1979-CasanovaB #relational- The Logic of a Relational Data Manipulation Language (MAC, PAB), pp. 101–109.
POPL-1979-Harel #recursion #source code- Recursion in Logics of Programs (DH), pp. 81–92.
POPL-1979-Pratt #process- Process Logic (VRP), pp. 93–100.
DAC-1979-Bening #physics #simulation- Developments in computer simulation of gate level physical logic (LB), pp. 561–567.
DAC-1979-IshiiYIS #diagrams- An experimental input system of hand-drawn logic circuit diagram for LSI CAD (MI, MY, MI, HS), pp. 114–120.
DAC-1979-KjelkerudT #deduction #fault #generative #simulation #testing #using- Generation of hazard free tests using the D-algorithm in a timing accurate system for logic and deductive fault simulation (EK, OT), pp. 180–184.
DAC-1979-KjelkerudT79a #modelling #simulation- Methods of modelling digital devices for logic simulation (EK, OT), pp. 235–241.
DAC-1979-OhnoMS #scalability #using #verification- Logic verification system for very large computers using LSI’s (YO, MM, KS), pp. 367–374.
DAC-1979-Sherwood #hybrid #scheduling- A hybrid scheduling technique for hierarchical logic simulators or “Close Encounters of the Simulated Kind” (WS), pp. 249–254.
DAC-1979-Wilcox #functional #simulation- Digital logic simulation at the gate and functional level (PSW), pp. 242–248.
STOC-1979-DeMilloL #complexity- Some Connections between Mathematical Logic and Complexity Theory (RAD, RJL), pp. 153–159.
STOC-1979-MeyerW #on the #power of- On the Expressive Power of Dynamic Logic (ARM, KW), pp. 167–175.
SIGMOD-1978-NavatheS #database #design #representation- View Representation in Logical Database Design (SBN, MS), pp. 144–156.
SIGMOD-1978-Nicolas #dependence #first-order #formal method #functional #multi- First Order Logic Formalization for Functional, Multivalued and Mutual Dependencies (JMN), pp. 40–46.
VLDB-1978-AdibaCE #database #distributed #relational #using- A Distributed Data Base System Using Logical Relational Machines (MEA, JYC, CE), pp. 450–461.
VLDB-1978-FloryK #database #design- A Model and a Method for Logical Data Base Design (AF, JK), pp. 333–341.
ICALP-1978-Harel #source code- Arithmetical Completeness in Logics of Programs (DH), pp. 268–288.
ICALP-1978-Zilli #combinator #normalisation- Head Recurrent Terms in Combinatory Logic: A Generalization of the Notion of Head Normal Form (MVZ), pp. 477–493.
POPL-1978-CartwrightO #hoare #strict- Unrestricted Procedure Calls in Hoare’s Logic (RC, DCO), pp. 131–140.
POPL-1978-HarelP #nondeterminism #source code- Nondeterminism in Logics of Programs (DH, VRP), pp. 203–213.
DAC-1978-BayeganA #design #editing #interactive #layout #simulation- An integrated system for interactive editing of schematics, logic simulation and PCB layout design (HMB, EJA), pp. 1–8.
DAC-1978-CaseS #fault #simulation- SALOGS-IV-A program to perform logic simulation and fault diagnosis (GRC, JDS), pp. 392–397.
DAC-1978-El-Ziq #automation #constraints #design #network- Logic design automation of MOS combinational networks with fan-in, fan-out constraints (YMEZ), pp. 240–249.
DAC-1978-KoppelSP #performance- A high performance delay calculation software system for MOSFET digital logic chips (AK, SS, PP), pp. 405–417.
DAC-1978-LekkosP #how #pseudo #refinement #using- How to develop module logic using pseudo-code and stepwise refinement (AAL, CMP), pp. 366–370.
DAC-1978-McWilliamsW #design #named- SCALD: Structured Computer-Aided Logic Design (TMM, LCWJ), pp. 271–277.
DAC-1978-NakamuraMTTFK #named- LORES — Logic Reorganization System (SN, SM, CT, MT, HF, KK), pp. 250–260.
DAC-1978-Stange #network #scalability- A test methodology for large logic networks (GHS), pp. 103–109.
STOC-1978-Pratt - A Practical Decision Method for Propositional Dynamic Logic: Preliminary Report (VRP), pp. 326–337.
DAC-1977-BoseS #detection- Detection of static and dynamic hazards in logic nets (AKB, SAS), pp. 220–224.
DAC-1977-BottorffFGO #generative #network #scalability #testing- Test generation for large logic networks (PSB, REF, NHG, EJO), pp. 479–485.
DAC-1977-EichelbergerW #design #testing- A logic design structure for LSI testability (EBE, TWW), pp. 462–468.
DAC-1977-El-ZiqS #automation #design #network- Logic design automation of diagnosable MOS combinational logic networks (YMEZ, SYHS), pp. 205–215.
DAC-1977-GodoyFB #automation #design #testing- Automatic checking of logic design structures For compliance with testability ground rules (HCG, GBF, PSB), pp. 469–478.
DAC-1977-Noon #design #validation #verification- A Design Verification and Logic Validation System (WAN), pp. 362–368.
DAC-1977-Somaia #automation #testing- An automated simultaneous probing system for testing complex logic assemblies “the bed of nails system” (RHS), pp. 64–67.
STOC-1977-Constable #formal method #on the #programming- On the Theory of Programming Logics (RLC), pp. 269–285.
STOC-1977-FischerL #source code- Propositional Modal Logic of Programs (MJF, REL), pp. 286–294.
STOC-1977-HarelMP #source code- Computability and Completeness in Logics of Programs (DH, ARM, VRP), pp. 261–268.
STOC-1977-ODonnell #combinator #equation #lisp #program transformation #recursion- Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic (MO), pp. 295–305.
ICALP-1976-Kroger #reasoning #source code- Logical Rules of Natural Reasoning about Programs (FK), pp. 87–98.
DAC-1976-Case #analysis #fault- Analysis of actual fault mechanisms in CMOS logic gates (GRC), pp. 265–270.
DAC-1976-GoundanH #clustering #fault- Partitioning logic circuits to maximize fault resolution (AG, JPH), pp. 271–277.
DAC-1976-SmithL #automation #diagrams #generative- Automatic generation of logic diagrams (JAS, JGL), pp. 377–391.
DAC-1976-Soong #design- The design of program logic (NLS), pp. 354–365.
DAC-1976-Ulrich #simulation- Non-integral event timing for digital logic simulation (EGU), pp. 61–67.
DAC-1976-WilcoxR #fault #interactive #named- F/LOGIC — An interactive fault and logic simulator for digital circuits (PSW, HR), pp. 68–73.
VLDB-1975-HubbardR #automation #design- Automating Logical File Design (GUH, NR), pp. 227–253.
VLDB-1975-ShoshaniB #database #implementation #on the- On the Implementation of a Logical Data Base Converter (AS, KB), pp. 529–531.
DAC-1975-Groger #approach #clustering- A new approach to structural partitioning of computer logic (HJG), pp. 378–383.
DAC-1975-HemmingH #evolution #modelling #simulation- Digital logic simulation models and evolving technology (CWHJ, JMH), pp. 85–94.
DAC-1975-IshigaKS #clustering- A logic partitioning procedure by interchanging clusters (TI, TK, SS), pp. 369–377.
DAC-1975-Moto-OkaKSS #design- Logic design system in Japan (TMO, TK, TS, MS), pp. 241–250.
DAC-1975-SchulerUBB #concurrent #generative #random testing #simulation #testing #using- Random test generation using concurrent logic simulation (DMS, EGU, TEB, SPB), pp. 261–267.
DAC-1975-ThompsonB75a #implementation #multi #re-engineering #simulation- The software engineering technique of data hiding as applied to multi-level model implementation of logical devices in digital simulation (EWT, NB), pp. 195–201.
ICALP-1974-Kreczmar #algorithm #problem- Effectivity Problems of Algorithmic Logic (AK), pp. 584–600.
DAC-1974-HananMS #approach #clustering #interactive #problem- An interactive man-machine approach to the computer logic partitioning problem (MH, AM, PKWS), pp. 70–81.
DAC-1973-HiranoH #design- Computer aided design system for logic equipment applied to design of electronic switching equipment (TH, KH), pp. 205–212.
DAC-1973-Keiner #functional #simulation #testing- Functional testing A user looks at logic simulation (WLK), pp. 151–158.
DAC-1973-PillingS #predict- Computer-aided prediction of delays in LSI logic systems (DJP, HBS), pp. 182–186.
DAC-1973-Ruehli #design- Electrical considerations in the computer aided design of logic circuit interconnections (AER), pp. 262–266.
DAC-1973-Shenkman #diagrams #functional #generative- Circuit diagram generation via functional logic (SMS), pp. 267–273.
DAC-1973-SzygendaL #functional #simulation- Integrated techniques for functional and gate-level digital logic simulation (SAS, AAL), pp. 159–172.
DAC-1972-Bliss #design- Computer aided logic design (FWB), pp. 259–263.
DAC-1972-ChangDE #analysis #fault #self #simulation- Logic simulation and fault analysis of a self-checking switching processor (HYC, RCD, RAE), pp. 128–137.
DAC-1972-Lewis #bound #detection #simulation- Hazard detection by a quinary simulation of logic devices with bounded propagation delays (DWL), pp. 157–164.
DAC-1972-McClure #fault #simulation- Fault simulation of digital logic utilizing a small host machine (RMM), pp. 104–110.
DAC-1972-Robison #automation #design #simulation- Applications of logic simulation in design automation at Texas Instruments (JMR), pp. 138–143.
DAC-1972-SandersonM #diagrams- A logic and signal flow diagram subsystem (GS, AM), pp. 250–257.
DAC-1972-Szygenda #generative #named #simulation #testing- TEGAS2 — anatomy of a general purpose TEST GENERATION AND SIMULATION system for digital logic (SAS), pp. 116–127.
DAC-1972-UlrichBW #analysis #simulation- Fault-test analysis techniques based on logic simulation (EGU, TEB, LRW), pp. 111–115.
SIGFIDET-1971-DateH #independence- File Definition and Logical Data Independence (CJD, PH), pp. 117–138.
DAC-1971-Barker #design #interactive #simulation #visual notation- An interactive graphical logic design simulation system (WBB), pp. 299–303.
DAC-1971-Bening #fault #maintenance- Application of a logic fault analyzer to the manufacture and maintenance of the CONTROL DATA 7600 computer (LCBJ), pp. 231–235.
DAC-1971-HarrisonO #analysis #simulation- Race analysis of digital systems without logic simulation (RAH, DJO), pp. 82–94.
DAC-1971-HowieT #named #online #simulation- OLLS: The On-Line Logical Simulation System (HRH, RMT), pp. 314–323.
DAC-1971-LarsenM #clustering #equation #layout- Partitioning and ordering of logic equations for optimum MOS LSI device layout (RPL, LM), pp. 131–142.
DAC-1971-LinnemannM #design- Logic Design System (FGL, CEM), pp. 324–346.
DAC-1971-Nagamine #automation #design #source code- An automated method for designing logic circuit diagnostic programs (MN), pp. 236–241.
DAC-1971-RussoS #automation #named- ALMS: Automated logic mapping system (RLR, PKWS), pp. 118–130.
DAC-1970-Cole #automation #functional #generative #simulation #source code- Automatic generation of functional logic test programs through simulation (FBC), pp. 116–127.
DAC-1970-CorreiaCPS #design #interactive #problem #testing- Minimizing the problem of logic testing by the interaction of a design group with user-oriented facilities (MC, DC, FP, TJS), pp. 100–107.
DAC-1970-Flomenhoft #design #testing- A system of computer aids for designing logic circuit tests (MJF), pp. 128–131.
DAC-1970-FriedmanY #automation #design #generative #quality- Quality of designs from an automatic logic generator (ALERT) (TDF, SCY), pp. 71–89.
DAC-1970-PatchZ #realtime- Real time diagnosis of logic assemblies (FDP, LMZ), pp. 108–115.
DAC-1970-SassK #evaluation #layout- An 1130-based logic, layout and evaluation system (WHS, SPK), pp. 64–70.
DAC-1970-Sr #analysis #clustering #graph #reduction- Partitioning of logic graphs: A theoretical analysis of pin reduction (RBHS), pp. 54–63.
DAC-1969-Bening #simulation- Accurate simulation of high speed computer logic (LCBJ), pp. 103–112.
DAC-1969-HornbuckleTSD #design- Computer-aided logic design on the TX-2 computer (GDH, ELT, RNS, RJD), pp. 357–369.
DAC-1969-RaderI #equation- Aw expanded logic equation list for checkout (JAR, DAI), pp. 291–296.
STOC-1969-Hodes #complexity #geometry- The Logical Complexity of Geometric Properties in the Plane (LH), pp. 249–254.
DAC-1968-AllenGHS - A syntax-directed logic simulator (CMA, DDG, WMH, RWS).
DAC-1968-CorreiaD #documentation #using- The use of engineering documentation in support of a high density logic test system (MC, RLD).
DAC-1968-Marin #algorithm #on the #strict #synthesis #using- On a general synthesis algorithm of logical circuits using a restricted inventory of integrated circuits (MAM).
DAC-1968-Rader #equation #syntax- Application of a syntax driver to logic equation processing and data-control card scanning (JAR).
DAC-1968-Uhlik #automation #diagrams- Graphic update of automated logic diagrams (RJU).
DAC-1967-McKinney - Synchronous Logic Simulator (JGM).
DAC-1967-Richards #automation #equation #named #programming #simulation- SWAP — a programming system for automatic simulation, wiring and placement of logical equations (DLR).
SHARE-1966-Stone #clustering- Logic partitioning (AJS).
SHARE-1965-Merrill - Ternary logic in digital computers (RDMJ).