VSL 2014: VIENNA SUMMER OF LOGIC 2014

ALL PROCEEDINGS PAPERS

All VolumesAll PapersGlobal Author IndexGlobal Keyword Index
AuthorsTitleConferencePaperTalk
Beniamino AccattoliOn the Formalization of Lambda-Calculus Confluence and ResidualsIWCJul 13 09:25
Samuel MimramAn Introduction to Higher-Dimensional Rewriting TheoryIWC
Yves Guiraud, Eric Hoffbeck and Philippe MalbosConfluence of linear rewriting and homology of algebrasIWCJul 13 15:30
Lars HellströmCritical Pairs in Network RewritingIWCJul 13 12:00
Nao Hirokawa, Aart Middeldorp and Christian SternagelNormalization Equivalence of Rewrite SystemsIWCJul 13 16:30
Julian Nagele and René ThiemannCertification of Confluence Proofs using CeTAIWCJul 13 10:45
Naoki Nishida, Makishi Yanagisawa and Karl GmeinerOn Proving Confluence of Conditional Term Rewriting Systems via the Computationally Equivalent TransformationIWCJul 13 12:30
Michio Oyamaguchi and Nao HirokawaConfluence and Critical-Pair-Closing SystemsIWCJul 13 11:15
Masahiko Sakai, Michio Oyamaguchi and Mizuhito OgawaNon-E-overlapping and weakly shallow TRSs are confluent (Extended abstract)IWCJul 13 17:00
Anna Slobodova, Jared Davis and Sol SwordsMicrocode Verification - Another Piece of the Microprocessor Verification PuzzleITPJul 14 15:00
Peter SewellRetrofitting RigourITPJul 16 15:00
Rod Chapman and Florian SchandaAre We There Yet? 20 Years of Industrial Theorem Proving with SPARKITPJul 15 15:00
Abhishek Anand and Vincent RahliTowards a Formally Verified Proof AssistantITPJul 14 10:45
Vincent Aravantinos and Sofiene TaharImplicational Rewriting Tactics in HOLITPJul 17 15:30
Jeremy Avigad, Robert Y. Lewis and Cody RouxA heuristic prover for real inequalitiesITPJul 16 16:30
Evmorfia-Iro Bartzia and Pierre-Yves StrubA Formal Library for Elliptic Curves in the Coq Proof AssistantITPJul 15 10:45
Jasmin Christian Blanchette, Johannes Hölzl, Andreas Lochbihler, Lorenz Panny, Andrei Popescu and Dmitriy TraytelTruly Modular (Co)datatypes for Isabelle/HOLITPJul 14 16:30
Jasmin Christian Blanchette, Andrei Popescu and Dmitriy TraytelCardinals in Isabelle/HOLITPJul 15 12:15
Sandrine Blazy, Vincent Laporte and David PichardieVerified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying CodeITPJul 16 17:30
Timothy Bourke, Rob Van Glabbeek and Peter HöfnerShowing invariance compositionally for a process algebra for network protocolsITPJul 16 14:30
Frédéric Chyzak, Assia Mahboubi, Thomas Sibut-Pinote and Enrico TassiA Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3)ITPJul 16 10:45
David CockFrom Operational Models to Information Theory - Side Channels in pGCL with IsabelleITPJul 14 14:30
Cyril Cohen and Anders MörtbergA Coq Formalization of Finitely Presented ModulesITPJul 16 11:15
Robert DockinsFormalized, effective domain theory in CoqITPJul 17 10:45
Christian Doczkal and Gert SmolkaCompleteness and Decidability Results for CTL in CoqITPJul 17 11:15
Jean-François DufourdHypermap Specification and Certified Linked Implementation using OrbitsITPJul 17 15:00
Kento Emoto, Frédéric Loulergue and Julien TessonA Verified Generate-Test-Aggregate Coq Library for Parallel Programs ExtractionITPJul 15 11:15
Jason Gross, Adam Chlipala and David SpivakExperience Implementing a Performant Category-Theory Library in CoqITPJul 14 17:30
Nao Hirokawa, Aart Middeldorp and Christian SternagelA New and Formalized Proof of Abstract CompletionITPJul 17 14:30
Ramana Kumar, Rob Arthan, Magnus O. Myreen and Scott OwensHOL with Definitions: Semantics, Soundness, and a Verified ImplementationITPJul 14 11:45
Peter LammichVerified Efficient Implementation of Gabow's Strongly Connected Component AlgorithmITPJul 15 11:45
Andreas Lochbihler and Johannes HölzlRecursive Functions on Lazy Lists via Domains and TopologiesITPJul 14 17:00
Mohamed Yousri Mahmoud, Vincent Aravantinos and Sofiene TaharFormal Verification of Optical Quantum Flip GateITPJul 16 11:45
Gregory Malecha, Adam Chlipala and Thomas BraibantCompositional Computational ReflectionITPJul 17 12:15
Daniel Matichuk, Toby Murray and Makarius WenzelAn Isabelle Proof Method LanguageITPJul 15 16:30
J Strother MooreProof Pearl: Proving a Simple Von Neumann Machine Turing CompleteITPJul 14 12:15
Magnus O. Myreen and Jared DavisThe reflective Milawa theorem prover is sound (down to the machine code that runs it)ITPJul 14 11:15
Guyslain Naves and Arnaud SpiwackBalancing lists: a proof pearlITPJul 15 14:30
Tobias Nipkow and Dmitriy TraytelUnified Decision Procedures for Regular Expression EquivalenceITPJul 16 17:00
Martin Ring and Christoph LüthCollaborative Interactive Theorem Proving with ClideITPJul 15 17:30
Umair Siddique, Mohamed Yousri Mahmoud and Sofiene TaharOn the Formalization of Z-Transform in HOLITPJul 16 12:15
Matthieu Sozeau and Nicolas TabareauUniverse Polymorphism in CoqITPJul 17 11:45
Makarius WenzelAsynchronous User Interaction and Tool Integration in Isabelle/PIDEITPJul 15 17:00
Rob ArthanHOL Constant Definitions Done RightITPJul 15 12:45
Matt Kaufmann and J Strother MooreRough Diamond: An Extension of Equivalence-based RewritingITPJul 14 12:45
Robbert Krebbers, Xavier Leroy and Freek WiedijkFormal C semantics: CompCert and the C standardITPJul 17 12:45
Disha Puri, Sandip Ray, Kecheng Hao and Fei XieMechanical Certification of Loop Pipelining Transformations: A PreviewITPJul 16 12:45
Gergei Bana and Hubert Comon-LundhProtocol Indistinguishability and the Computationally Complete Symbolic AttackerFCS-FCCJul 18 16:30
Abhishek Bichhawat, Vineet Rajani, Deepak Garg and Christian HammerGeneralizing Permissive-Upgrade in Dynamic Information Flow AnalysisFCS-FCCJul 18 15:00
Gergei Bana and Mitsuhiro OkadaFitting's Embedding of Classical Logic in S4 and Trace Properties in the Computational ModelFCS-FCCJul 18 17:10
Sibylle FroeschleOn Well-Founded Security Protocols (Extended Abstract)FCS-FCCJul 18 16:50
Hubert Comon-Lundh, Veronique Cortier and Guillaume ScerriA tool for automating the computationally complete symbolic attackerFCS-FCCJul 18 12:00
Catalin HritcuMicro-Policies: Formally Verified Tagging Schemes for Safety and Security (Extended Abstract)FCS-FCCJul 18 15:30
Piotr Mardziel, Mario Alvim and Michael HicksAdversary Gain vs. Defender Loss in Quantified Information FlowFCS-FCCJul 18 14:30
Alberto Cappai and Ugo Dal LagoTowards a Coinductive Characterization of Computational IndistinguishabilityFCS-FCCJul 18 12:20
Max Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov and Carolyn TalcottTowards Timed Models for Cyber-Physical Security ProtocolsFCS-FCCJul 18 17:30
Anupam Datta, Dilsun Kaynar, Divya Sharma and Arunesh SinhaActual Causes of Security Violations (Short Paper)FCS-FCCJul 18 12:40
John D Ramsdell, Daniel Dougherty, Joshua Guttman and Paul D RoweA Hybrid Analysis for Security Protocols with StateFCS-FCCJul 18 09:45
Marc BezemCoherent Logic and ApplicationsCHRJul 18 09:00
Ralf GerlichAutomated Test Case Generation and Model Checking with CHRCHRJul 18 10:45
Falco Nogatz and Thom FruehwirthFrom XML Schema to JSON Schema: Translation with CHRCHRJul 18 11:15
Edmund Soon Lee Lam and Iliano CervesatoConstraint Handling Rules with Multiset Comprehension PatternsCHRJul 18 11:45
Jean-Raymond AbrialProgram Verification (B Method)APPAJul 18 16:30
Clark Barrett, Pascal Fontaine and Leonardo De MouraSMT-SolversAPPAJul 18 09:30
Gilles Barthe, François Dupressoir, Benjamin Grégoire, Benedikt Schmidt and Pierre-Yves StrubSecurityAPPAJul 18 17:00
Christoph BenzmüllerHigher-Order Automated Theorem ProversAPPAJul 18 11:15
Gilles DowekDeduction Modulo TheoryAPPAJul 18 15:00
Alessio GuglielmiDeep InferenceAPPAJul 18 17:30
Marijn Heule and Armin BiereSatisfiability SolversAPPAJul 18 09:00
Alexander LeitschMathematical Proof AnalysisAPPAJul 18 15:30
Dale MillerFoundational Proof CertificatesAPPAJul 18 14:30
Christine Paulin-MohringCalculus of Inductive ConstructionsAPPAJul 18 12:30
Stephan Schulz and Geoff SutcliffeProof Generation for Saturating First-Order Theorem ProversAPPAJul 18 10:45
Makarius WenzelInteractive Theorem Provers from the perspective of Isabelle/IsarAPPAJul 18 12:00
Andrew Reynolds, Cesare Tinelli and Leonardo De MouraFinding Conflicting Instances of Quantified Formulas in SMTQUANTIFYJul 18 17:30
Michael Cashmore, Maria Fox and Enrico GiunchigliaEncoding Reachability with QuantificationQUANTIFYJul 18 11:30
Javier Álvez, Montserrat Hermo and Paqui LucioProjective Quantifier Elimination for Equational Constraint SolvingQUANTIFYJul 18 15:30
Aarne RantaMachine Translation: Green, Yellow, and Red (abstract)NLSRJul 18 09:00
Cleo Condoravdi, Kyle Richardson, Vishal Sikka, Asuman Suenbuel and Richard WaldingerNatural Language Access to DataNLSRJul 18 11:15
Jeroen Van Grondelle, Christina Unger and Frank SmitExposing Predictive Analytics through Natural LanguageNLSRJul 18 10:45
Ulrich Berger, Alison Jones and Monika SeisenbergerProgram Extraction Applied to Monadic ParsingNLCSJul 18 16:30
Heather BurnettMereological Comparatives in Delineation SemanticsNLCSJul 17 11:15
Claudia Casadio and Aleksandra Kislak-MalinowskaComputing Italian clitic and relative clauses with tupled pregroupsNLCSJul 17 15:30
Robin CooperHow to do things with typesNLCSJul 17 10:45
Marcos CramerModelling implicit dynamic introduction of function symbols in mathematical textsNLCSJul 18 15:30
Richard CrouchTransfer Semantics for the Clear ParserNLCSJul 18 11:45
Tim FernandoSignatures as open-ended typesNLCS
Christophe Fouquere and Myriam QuatriniDivergence in DialoguesNLCSJul 18 15:00
Nissim FrancezProof-Theoretic Semantics for intensional transitive verbsNLCSJul 17 11:45
Makoto Kanazawa and Junri ShimadaToward a Logic of Cumulative QuantificationNLCSJul 17 17:30
Juyeon Kang and Saint Dizier PatrickAnalyzing and Modelling the Structure of Argument Compounds in Logic: the case of technical textsNLCSJul 18 12:15
Stepan KuznetsovOn Translating Context-Free Grammars into Lambek Categorial GrammarsNLCSJul 18 17:00
Kristina LiefkeSolving Partee's Temperature Puzzle in an EFL-OntologyNLCSJul 17 17:00
Jiří Maršík and Maxime AmblardAlgebraic Effects and Handlers in Natural Language InterpretationNLCSJul 17 16:30
Rohit ParikhGrice, Hoare and Nash: some comments on conversational implicatureNLCSJul 17 12:15
Ondrej Rypacek and Mehrnoosh SadrzadehA low-level treatment of quantifiers in categorical compositional distributional semanticsNLCSJul 18 14:30
Josep SilvaAutomatic Detection of Webpage Candidates for Site-Level Web Template ExtractionWWVJul 18 14:30
R. Ramanujam and S. SheerazuddinA local logic for realizability in web service choreographiesWWVJul 18 17:00
Asad Ali and Maribel FernandezStatic Enforcement of Role-Based Access ControlWWVJul 18 16:30
Jasmin Christian BlanchetteMy Life with an Automatic Theorem ProverVampireJul 23 14:30
Laura Kovacs and Andrei VoronkovFirst-Order Theorem Proving with VampireVampireJul 23 10:45
Ashutosh GuptaProofs in VampireVampireJul 23 12:00
Giles Reger, Martin Suda and Andrei VoronkovPlaying with AVATARVampireJul 23 12:30
Armin Biere, Ioan Dragan, Laura Kovacs and Andrei VoronkovSAT solving experiments in VampireVampireJul 23 16:30
Evgeny Kotelnikov, Laura Kovacs and Andrei VoronkovFirst Class Boolean Type in First-Order Theorem Proving and TPTPVampireJul 23 17:00
Ashutosh Gupta, Laura Kovacs, Bernhard Kragl and Andrei VoronkovReasoning in First-Order Theories with ExtensionalityVampireJul 23 17:30
Nicola GambinoA unified approach to Univalent Foundations and Homotopical AlgebraRTA-TLCA
Kohei Honda, Nobuko Yoshida and Martin BergerProcess Types as a Descriptive Tool for Interaction: Control and the Pi-CalculusRTA-TLCA
Manfred Schmidt-SchaussConcurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk)RTA-TLCA
Andreas Abel, Brigitte Pientka, Anton Setzer and David ThibodeauUnnesting of CopatternsRTA-TLCAJul 15 17:30
Takahito Aoto, Yoshihito Toyama and Kazumasa UchidaProving Confluence of Term Rewriting Systems via Persistency and Decreasing DiagramsRTA-TLCAJul 14 17:30
Kyungmin Bae and Jose MeseguerPredicate Abstraction of Rewrite TheoriesRTA-TLCAJul 16 11:15
Marc Bagnol and Clément AubertUnification and Logarithmic SpaceRTA-TLCAJul 14 11:45
Stefano Berardi and Silvia SteilaRamsey Theorem as an intuitionistic property of well founded relationsRTA-TLCAJul 15 10:45
Aleš Bizjak, Lars Birkedal and Marino MiculanA Model of Countable Nondeterminism in Guarded Type TheoryRTA-TLCAJul 16 15:30
Guillaume BurelCut Admissibility by SaturationRTA-TLCAJul 16 10:45
Carles Creus and Guillem GodoyAutomatic Evaluation of Context-Free Grammars (System Description)RTA-TLCAJul 14 12:45
Carles Creus and Guillem GodoyTree Automata with Height Constraints between BrothersRTA-TLCAJul 17 10:45
Łukasz CzajkaA Coinductive Confluence Proof for Infinitary Lambda-Calculus.RTA-TLCAJul 14 16:30
Daniel de Carvalho and Jakob Grue SimonsenAn Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free RewritingRTA-TLCAJul 14 11:15
Mariangiola Dezani-Ciancaglini and Silvia GhilezanPreciseness of subtyping on intersection and union typesRTA-TLCAJul 16 17:30
Martin Escardo and Alex SimpsonAbstract datatypes for real numbers in type theoryRTA-TLCAJul 16 16:30
Peng Fu and Aaron StumpSelf Types for Dependently Typed Lambda EncodingsRTA-TLCAJul 15 16:30
Carsten Fuhs and Cynthia KopFirst-Order Formative RulesRTA-TLCAJul 15 11:45
Nao Hirokawa and Georg MoserAutomated Complexity Analysis Based on Context-Sensitive RewritingRTA-TLCAJul 14 12:15
Martin Hofmann and Georg MoserAmortised Resource Analysis and Typed Polynomial InterpretationsRTA-TLCAJul 15 15:30
Jiaxiang Liu, Nachum Dershowitz and Jean-Pierre JouannaudConfluence by Critical Pair AnalysisRTA-TLCAJul 14 17:00
Carlos Lombardi, Alejandro Rios and Roel de VrijerProof terms for infinitary rewritingRTA-TLCAJul 17 11:45
Roberto MaieliConstruction of retractile proof structuresRTA-TLCAJul 16 12:15
Paul-André MellièsLocal states in string diagramsRTA-TLCAJul 16 17:00
Koji Nakazawa and Tomoharu NagaiReduction System for Extensional Lambda-mu CalculusRTA-TLCAJul 17 11:15
Cody Roux and Floris van DoornThe Structural Theory of Pure Type SystemsRTA-TLCAJul 15 17:00
Manfred Schmidt-Schauss and David SabelApplicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMBRTA-TLCAJul 14 15:30
Sylvain SchmitzImplicational Relevance Logic is 2-ExpTime-CompleteRTA-TLCAJul 14 10:45
Richard StatmanNear semi-rings and lambda calculusRTA-TLCAJul 17 12:15
Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon Moore, Traian Florin Serbanuta and Grigore RosuAll-Path Reachability LogicRTA-TLCAJul 16 11:45
Christian Sternagel and René ThiemannFormalizing monotone algebras for certification of termination- and complexity proofsRTA-TLCAJul 15 12:15
Thomas Sternagel and Aart MiddeldorpConditional Confluence (System Description)RTA-TLCAJul 14 18:00
Akihisa Yamada, Keiichirou Kusakari and Toshiki SakabeNagoya Termination ToolRTA-TLCAJul 15 12:45
Hans Zantema, Barbara Koenig and Sander BrugginkTermination of Cycle RewritingRTA-TLCAJul 15 11:15
Marcin Benke, Viviana Bono and Aleksy SchubertLucretia — intersection type polymorphism for scripting languagesITRSJul 18 14:30
Jan Bessai, Boris Düdder, Andrej Dudenhefner and Moritz MartensDelegation-based Mixin Composition SynthesisITRSJul 18 17:00
Mario Coppo, Mariangiola Dezani-Ciancaglini, Ines Margaria and Maddalena ZacchiOn Isomorphism of "Functional'' Intersection and Union TypesITRSJul 18 11:15
Ugo De Liguoro and Tzu-Chun ChenSemantic Types for Classes and MixinsITRSJul 18 16:30
Charles Grellois and Paul-André MellièsIndexed linear logic and higher-order model checkingITRSJul 18 12:30
Kentaro KikuchiUniform Proofs of Normalisation and Approximation for Intersection TypesITRSJul 18 12:00
Mário Pereira, Sandra Alves and Mário FloridoLiquid Intersection TypesITRSJul 18 15:00
Richard StatmanA Finite Model Property for Intersection TypesITRSJul 18 10:45
Uwe WaldmannHierarchic Superposition RevisitedPAARJul 23 09:15
Negin Arhami and Geoff SutcliffeThe Efficiency of Automated Theorem Proving by Translation to Less Expressive LogicsPAARJul 23 11:15
Joshua BaxA Model Guided Instantiation Heuristic for the Superposition Calculus with TheoriesPAARJul 23 14:30
Maria Paola Bonacina and David PlaistedSGGS Theorem Proving: an ExpositionPAARJul 23 17:30
Simon CruanesLogtk : A Logic ToolKit for Automated Reasoning and its ImplementationPAARJul 23 15:00
Thibault Gauthier, Cezary Kaliszyk, Chantal Keller and Michael NorrishBeagle as a HOL4 external ATP methodPAARJul 23 16:30
Cezary Kaliszyk, Josef Urban and Jiri VyskocilMachine Learner for Automated Reasoning 0.4 and 0.5PAARJul 23 11:45
Muhammad Nassar and Geoff SutcliffeAutomated Theorem Proving using the TPTP Process Instruction LanguagePAARJul 23 10:45
Salman Saghafi and Daniel DoughertyRazor: Provenance and Exploration in Model-FindingPAARJul 23 17:00
Sophie Tourret, Mnacho Echenim and Nicolas PeltierA Deductive-Complete Constrained Superposition Calculus for Ground Flat Equational ClausesPAARJul 23 08:45
Josef UrbanBliStr: The Blind StrategymakerPAARJul 23 12:15
Daniel WandPolymorphic+Typeclass SuperpositionPAARJul 23 15:30
Alex SimpsonCyclic Proof for Quantitative LogicsGSBJul 13 14:30
Anna ZamanskySemantics and Proof Theory in Team Play: The Case of Paraconsistent LogicsGSBJul 13 09:05
Rob Arthan and Paulo OlivaOn Affine Logic and Łukasiewicz LogicGSBJul 13 17:20
Paolo BaldiA Proof Theoretic Approach to Standard CompletenessGSBJul 13 16:55
Roy Dyckhoff and Sara NegriCoherentisation of Accessibility Conditions in Labelled Sequent CalculiGSB
Giuseppe Greco, Sabine Frittella, Alexander Kurz, Alessandra Palmigiano and Vlasta SikimićDisplay-Type Calculi and Their Cut Elimination MetatheoremGSBJul 13 12:25
Dominic HughesSimpler Proof Net Quantifiers: Unification Nets (Work in Progress)GSBJul 13 17:45
Tomasz KowalskiLink Formulas in Implication Fragments of Substructural LogicsGSBJul 13 16:30
Ori Lahav and Yoni ZoharOn the Construction of Analytic Sequent Calculi for Sub-Classical LogicsGSBJul 13 09:50
Björn LellmannComparing Sequent Calculi via Hilbert-Style AxiomsGSBJul 13 10:45
Paolo Maffezioli and David GilbertSequent Systems for Classical Modal LogicsGSBJul 13 11:10
Sonia Marin and Lutz StraßburgerModular Systems for Intuitionistic Modal Logics in Nested SequentsGSBJul 13 15:15
Alexandre Rademaker and Hermann HaeuslerAn Intuitionisticaly Based Description LogicGSBJul 13 15:40
Daniyar ShamkanovLyndon Interpolation for the Modal mu-CalculusGSBJul 13 11:35
Thomas StuderOn Cuts and Cut-Elimination in Modal Fixed Point LogicsGSBJul 13 12:00
Jose MeseguerExtensible Symbolic System AnalysisUNIFJul 13 09:15
Jordi LevyOn the Limits of Second-Order UnificationUNIFJul 13 14:30
Peter Hibbs, Paliath Narendran and Shweta MehtoUnification Modulo Common List FunctionsUNIFJul 13 10:45
Franz Baader and Barbara MorawskaMatching with respect to general concept inclusions in the Description Logic ELUNIFJul 13 11:15
Philippe Balbiani and Tinko TinchevUnification in the normal modal logic Alt1UNIFJul 13 11:45
Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran and Christophe RingeissenOn Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract)UNIFJul 13 12:15
Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran and Christophe RingeissenHierarchical Combination of Matching Algorithms (Extended Abstract)UNIFJul 13 12:35
Leonardo Manuel Cabrer and George MectalfeFrom Admissibility to a New Hierarchy of Unification TypesUNIFJul 13 15:30
Maria Paola Bonacina and David PlaistedConstraint Manipulation in SGGSUNIFJul 13 16:30
Tatyana Novikova and Vladimir ZakharovTwo-sided unification is NP-completeUNIFJul 13 17:00
Alexander Baumgartner, Temur Kutsia, Jordi Levy and Mateu VillaretNominal Anti-UnificationUNIFJul 13 17:30
Andrea Vezzosi and Andreas AbelA Categorical Perspective on Pattern Unification (Extended Abstract)UNIFJul 13 18:00
Beta Ziliani and Matthieu SozeauTowards a better-behaved unification algorithm for CoqUNIFJul 13 18:30
Juan Pablo Galeotti, Carlo A. Furia, Eva May, Gordon Fraser and Andreas ZellerLoop Invariants by Mutation, Dynamic Validation, and Static CheckingWINGJul 23 15:30
Vivien Maisonneuve, Olivier Hermant and François IrigoinALICe: A Framework to Improve Affine Loop Invariant ComputationWINGJul 23 15:00
Nathan Wasser and Richard BubelA Theorem Prover Backed Approach to Array AbstractionWINGJul 23 14:30
Nicos AngelopoulosPerspectives SessionPLP
James CussensFirst-order representations for integer programmingPLPJul 17 08:55
Samer Abdallah and Nicolas GoldExploring probabilistic grammars of symbolic music using PRISMPLPJul 17 14:30
Ryosuke Kojima and Taisuke SatoPrefix and infix probability computation in PRISMPLPJul 17 10:45
Wannes Meert, Guy Van den Broeck and Adnan DarwicheLifted Inference for Probabilistic Logic ProgramsPLPJul 17 15:30
Eduardo Menezes de MoraisApproximated Probabilistic Answer Set ProgrammingPLPJul 17 12:15
Dimitar Shterionov and Gerda JanssenscProbLog: Restricting the Possible Worlds of Probabilistic Logic ProgramsPLPJul 17 11:45
Dries Van Daele, Angelika Kimmig and Luc De RaedtPageRank, ProPPR and Stochastic Logic ProgramsPLPJul 17 09:50
Wiebe Van Ranst and Joost VennekensAn OpenCL implementation of a forward sampling algorithm for CP-logicPLPJul 17 15:00
Jonas Vlasselaer, Joris Renkens, Guy Van den Broeck and Luc De RaedtCompiling Probabilistic Logic Programs into Sentential Decision DiagramsPLPJul 17 11:15
Ian MackieContinuations, closed reduction and process networksLinearityJul 13 14:30
Elaine PimentelOn modalities and linearityLinearityJul 13 08:45
Michele BasaldellaLudics without Designs I: TriadsLinearityJul 13 16:30
Taus Brock-Nannestad and Nicolas GuenotCut Elimination in Multifocused Linear LogicLinearityJul 13 12:15
Kaustuv ChaudhuriUndecidability of Multiplicative Subexponential LogicLinearityJul 13 10:45
Ugo Dal Lago and Margherita ZorziWave-Style Token Machines and Quantum Lambda CalculiLinearityJul 13 17:00
Edward Gan, Jesse A. Tov and Greg MorrisettType Classes for Lightweight Substructural TypesLinearityJul 13 15:30
Giulio Guerrieri and Lorenzo Tortora De FalcoA new point of view on the Taylor expansion of proof-nets and uniformityLinearityJul 13 18:00
Jennifer Paykin and Steve ZdancewicA Linear/Producer/Consumer model of Classical Linear LogicLinearityJul 13 11:45
Simona Ronchi Della Rocca, Antonio Bucciarelli and Delia KesnerThe inhabitation problem for non-idempotent intersectionLinearityJul 13 09:45
Marco SolieriGeometry of Resource Interaction – A Minimalist ApproachLinearityJul 13 17:30
Zachary Sparks and Amr SabrySuperstructural Reversible LogicLinearityJul 13 11:15
Sarah Grebing, Bernhard Beckert and Florian BöhlTowards Evaluating the Usability of Interactive Theorem ProversARW-DTJul 23 16:30
Markus BenderCombined Reasoning with Sets and Aggregation FunctionsARW-DTJul 23 17:00
Marco B. Caminati, Manfred Kerber, Christoph Lange and Colin RowatReasoning about AuctionsARW-DTJul 23 12:15
Dennis Felsing, Sarah Grebing, Vladimir Klebanov and Mattias UlbrichAutomating Regression VerificationARW-DTJul 23 12:45
Claudia Schon, Ulrich Furbach and Frieder StolzenburgAutomated Reasoning in Deontic LogicARW-DTJul 24 11:15
Matthias Horbach and Viorica Sofronie-StokkermansModular Verification of Interconnected Families of Uniform Linear Hybrid AutomataARW-DTJul 24 17:30
Mark Judge(AI) Planning to Reconfigure your Robot?ARW-DTJul 24 11:45
Mark JudgeUsing CSP Meta Variables in AI PlanningARW-DTJul 24 10:45
Patrick Koopmann and Renate A. SchmidtComputing Uniform Interpolants of ALCH-Ontologies with Background KnowledgeARW-DTJul 24 15:30
Alexander LyaletskiOn Herbrand theorems for classical and non-classical logicsARW-DTJul 24 12:45
Norbert MantheyExtended Resolution in Modern SAT SolvingARW-DTJul 24 09:45
Cláudia Nalon and George Bezerra SilvaA Resolution-Based Prover for Normal Modal LogicsARW-DTJul 24 15:00
Fabio Papacchini and Renate A. SchmidtModels Minimal Modulo Subset-Simulation for Expressive Propositional Modal LogicsARW-DTJul 24 14:30
John Stell, Renate A. Schmidt and David RydeheardTableau Development for a Bi-Intuitionistic Tense LogicARW-DTJul 23 17:30
Alexander Bolotov, Vasilyi Shangin, Oleg Grigoriev and Mariusz UrbanskiSocratic Proofs for Propositional Linear-Time LogicARW-DTJul 24 17:00
Christoph WernhardSecond-Order Characterizations of Definientia in Formula ClassesARW-DTJul 24 12:15
Max Wisniewski, Alexander Steen and Christoph BenzmüllerThe Leo-III ProjectARW-DTJul 24 16:30
Uwe EglyOn the Relation between Resolution Calculi for QBFs and First-order FormulasQBFJul 13 10:45
Valeriy Balabanov, Jie-Hong Roland Jiang, Mikoláš Janota and Magdalena WidlEfficient Extraction of QBF (Counter)models from Long-Distance Resolution ProofsQBFJul 13 11:45
Ankush Desai, Pranav Garg and P. MadhusudanA new reduction for event-driven distributed programsEC2Jul 18 11:45
Azadeh Farzan, Andreas Holzer, Niloofar Razavi and Helmut VeithConcolic Testing of Concurrent ProgramsEC2Jul 17 09:45
Felix Hargreaves, Daniel Merkle and Peter Schneider-KampGroup Communication Patterns for High Performance Computing in ScalaEC2Jul 17 15:30
Sidi Mohamed Beillahi, Umair Siddique and Sofiene TaharTowards the Application of Formal Methods in Process EngineeringFWFMJul 13 14:30
Tomer KotekExplaining the decompositionality of MSO using applications to combinatoricsFWFMJul 13 12:30
David Lawrence, Dimitri Racordon, Maximilien Colange, Steve Hostettler, Alban Linard, Edmundo López Bóbeda, Alexis Marechal, Matteo Risoldi, Nicolas Sedlmajer and Didier BuchsIntroducing Formal Verification with LegoFWFMJul 13 12:00
Heather Logas, Florent Kirchner, John Murray, Martin Schäf and Jim WhiteheadChekofv: Crowd-sourced Formal VerificationFWFMJul 13 11:00
Pratima K. ShahAn Example Demonstrating the Requirement of Fully Formal Verification MethodFWFMJul 13 15:00
Nikolay ShilovUsing Esoteric Language for Teaching Formal SemanticsFWFMJul 13 11:30
Lynne CoventryTackling the Awareness-Behaviour Divide in Security: (step 1) Understand the UserSTASTJul 18 09:00
Debora Jeske, Lynne Coventry and Pam BriggsDecision justifications for wireless network selectionSTASTJul 18 10:45
Oliver Buckley, Jason Nurse, Philip Legg, Michael Goldsmith and Sadie CreeseReflecting on the Ability of Enterprise Security Policy to Address Accidental Insider ThreatSTASTJul 18 11:30
Taciane Martimiano, Jean Everson Martina, Maina Olembo and Marcelo CarlosModelling User Devices in Security CeremoniesSTASTJul 18 12:15
Sven Uebelacker and Susanne QuielThe Social Engineering Personality FrameworkSTASTJul 18 14:30
Jaap Boender, Marieta Georgieva Ivanova, Florian Kammueller and Giuseppe PrimieroModeling Human Behaviour with Higher Order Logic: Insider ThreatsSTASTJul 18 15:15
Sven Kiljan, Harald Vranken and Marko van EekelenWhat You Enter Is What You Sign: input integrity in an online banking environmentSTASTJul 18 16:30
Lydia Kraus, Ina Wechsung and Sebastian MöllerUsing Statistical Information to Communicate Android Permission Risks to UsersSTASTJul 18 17:15
Ian MackieNumeral Systems in the Lambda CalculusTermGraphJul 13 09:15
Samuel MimramAn Introduction to Higher-Dimensional Rewriting TheoryTermGraphJul 13 14:30
Susumu YamasakiFixed Point Theory for Consistent Rewriting in Logic of Action with ReverseTermGraphJul 13 17:00
Sergio Antoy, Jacob Johannsen and Steven LibbyNeeded Computations Shortcutting Needed StepsTermGraphJul 13 10:45
Giulio Guerrieri, Luc Pellissier and Lorenzo Tortora De FalcoInjectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor ExpansionTermGraphJul 13 15:30
Naohi EguchiProving Termination of Unfolding Graph Rewriting for General Safe RecursionTermGraphJul 13 11:15
Clemens Grabmayer and Vincent van OostromNested Term GraphsTermGraphJul 13 11:45
Ian Mackie and Shinya SatoAn Implementation Model for Interaction NetsTermGraphJul 13 16:30
Tim Kelly and Ibrahim HabliBalancing the Formal and Informal in Safety Case ArgumentsVeriSureJul 23 08:45
Stephan Arlt, John Murray, Philipp Ruemmer and Martin SchäfQuantification of Verification ProgressVeriSureJul 23 09:15
Hardi Hungar and Michael Meyer Zu HörsteIntroducing Semi-Formal Specifications into a Distributed Development ProcessVeriSureJul 23 10:45
Kedar NamjoshiWitnessing an SSA TransformationVeriSureJul 23 11:15
Paul Curzon, Paolo Masci, Patrick Oladimeji, Rimvydas Rukšėnas, Harold Thimbleby and Enrico D'UrsoHuman-Computer Interaction and the Formal Certification and Assurance of Medical Devices: The CHI+MED ProjectVeriSureJul 23 12:15
Freek Verbeek, Julien Schmaltz, Sergey Tverdyshev, Holger Blasum and Oto HavleImplicit Assumptions in a Model for Separation KernelsVeriSureJul 23 14:30
Constance HeitmeyerAssurance and Verification of Security PropertiesVeriSureJul 23 15:00
Sebastian Nielebock, Tim Gonschorek and Frank OrtmeierA Graphical Notation for Probabilistic SpecificationsVeriSureJul 23 16:30
Sergey FrenkelAssurance of some system reliability characteristics in formal design verificationVeriSureJul 23 17:00
Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp, Fabian Emmes and Carsten FuhsSymbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic ProgramsCICLOPS-WLPEJul 18 14:30
Michael Codish, Luís Cruz-Filipe, Michael Frank and Peter Schneider-KampProofs for Optimality of Sorting Networks by Logic ProgrammingCICLOPS-WLPEJul 17 08:45
Joachim Jansen and Gerda JanssensRefining definitions with unknown opens using XSB for IDP3CICLOPS-WLPEJul 17 10:45
Alexei A. Morozov and Alexander F. PolupanovIntelligent Visual Surveillance Logic Programming: Implementation IssuesCICLOPS-WLPEJul 18 16:30
Vincent Bloemen, Daniel Diaz, Machiel van der Bijl and Salvador AbreuExtending the Finite Domain Solver of GNU PrologCICLOPS-WLPEJul 17 14:30
Gopalan Nadathur and Mary SouthernA Lambda Prolog Based Animation of Twelf SpecificationsCICLOPS-WLPEJul 17 11:15
Jose F. Morales and Manuel V. HermenegildoTowards Pre-Indexed TermsCICLOPS-WLPEJul 17 12:15
Md Solimul Chowdhury and Jia-Huai YouA System for Embedding Global Constraints into SATCICLOPS-WLPEJul 17 11:45
Jan WielemakerSWI-Prolog version 7 extensionsCICLOPS-WLPEJul 17 15:00
Flavio Cruz, Ricardo Rocha and Seth GoldsteinA Parallel Virtual Machine for Executing Forward-Chaining Linear Logic ProgramsCICLOPS-WLPEJul 18 17:00
Theofrastos Mantadelis and Ricardo RochaA Portable Prolog Predicate for Printing Rational TermsCICLOPS-WLPEJul 17 15:30
Luca CardelliMorphisms of reaction networks that couple structure to functionVEMDPJul 17 14:30
Masami HagiyaMolecular computers for molecular robots as hybrid systemsVEMDPJul 17 10:45
Andrew PhillipsComputational design of DNA strand displacement systemsVEMDPJul 17 09:00
Vincent DanosFormal mean field theories for graph rewritingVEMDPJul 17 16:55
Aadithya V. KarthikNINJA: Boolean Modelling and Formal Verification of Tiered-Rate Chemical Reaction NetworksVEMDPJul 17 16:30
Jean KrivineRule-Based modeling of DNA repairVEMDPJul 17 17:20
Lulu QianDNA-based circuits in well-mixed and spatially-organized systemsVEMDPJul 17 11:40
Philip BoeingAn Aspect Oriented Design and Modelling Framework for Synthetic BiologyVEMDPJul 17 17:45
Neil DalchauSoftware tools for analysing the chemical master equationVEMDPJul 17 17:45
Frits DannenbergGuiding the development of DNA walker systems to guarantee reliability and performanceVEMDPJul 17 17:45
Casey GrunDyNAMiC Workbench: Automated design and verification of dynamic DNA nanosystemsVEMDPJul 17 17:45
Paolo MilazzoIdentification of Components and Modular Verification of Biochemical PathwaysVEMDPJul 17 17:45
Savas Konur, Christophe Ladroue, Harold Fellermann, Daven Sanassy, Laurentiu Mierla, Florentin Ipate, Sara Kalvala, Marian Gheorghe and Natalio KrasnogorModeling and Analysis of Genetic Boolean Gates Using the Infobiotics WorkbenchVEMDPJul 17 12:35
Casey Grun, Karthik Sarma, Brian Wolfe, Seung Woo Shin and Erik WinfreeA domain-level DNA strand displacement reaction enumerator allowing arbitrary non-pseudoknotted secondary structuresVEMDPJul 17 09:50
Seung Woo Shin, Chris Thachuk and Erik WinfreeVerifying CRN Implementations: A Pathway Decomposition ApproachVEMDPJul 17 15:20
Robert F. Johnson and Erik WinfreeVerifying Polymer Reaction Networks using BisimulationVEMDPJul 17 12:10
Geoff SutcliffeThe TPTP Process Instruction Language, with ApplicationsUITPJul 17 09:15
Enrico TassiAsynchronous Processing of Formal Documents in CoqUITPJul 17 14:30
Andrew ButterfieldUTP2: Higher-Order Equational Reasoning by PointingUITPJul 17 17:30
Sarah Grebing, Bernhard Beckert and Florian BöhlHow to Put Usability into Focus: Using Focus Groups to Evaluate the Usability of Interactive Theorem ProversUITPJul 17 11:15
Gudmund Grov, Aleks Kissinger and Yuhui LinTinker, tailor, solver, proofUITPJul 17 10:45
Tomer Libal, Martin Riener and Mikheil RukhaiaAdvanced Proof Viewing in PROOFTOOLUITPJul 17 11:45
Florian RabeA Logic-Independent IDEUITPJul 17 17:00
Christian Sternagel and René ThiemannThe Certification Problem FormatUITPJul 17 12:15
Carst TankinkPIDE for Asynchronous Interaction with CoqUITPJul 17 15:30
Makarius WenzelSystem description: Isabelle/jEdit in 2014UITPJul 17 16:30
Tommaso Dreossi, Thao Dang and Carla PiazzaParameter Synthesis using Parallelotopic Enclosure and Applications to Epidemic ModelsHSBJul 23 15:30
Anatoly Sorokin, Oksana Sorokina and J. Douglas ArmstrongRKappa: Statistical sampling suite for Kappa models.HSBJul 24 14:55
Alvis Brazma, Karlis Cerans, Dace Ruklisa, Thomas Schlitt and Juris ViksnaModeling and analysis of qualitative behavior of gene regulatory networksHSBJul 24 09:45
Claudio Angione, Ezio Bartocci, Luca Bortolussi, Pietro Lio', Annalisa Occhipinti and Guido SanguinettiBayesian Design for Whole Cell Synthetic Biology ModelsHSBJul 24 14:30
Alexandre Rocca, Thao Dang and Eric FanchonExploiting the eigenstructures of linear systems to speed up reachability computationHSBJul 24 12:30
David C Sterratt, Oksana Sorokina and J Douglas ArmstrongIntegration of rule-based models and compartmental models of neuronsHSBJul 24 11:30
Charalampos Kyriakopoulos and Verena WolfOptimal Observation Time Points in Stochastic Chemical KineticsHSBJul 24 12:00
Donal Stewart, Stephen Gilmore and Michael CousinFM-Sim : A Hybrid Protocol Simulator of Fluorescence Microscopy Neuroscience Assays with Integrated Bayesian InferenceHSBJul 23 09:45
Vernon Asuncion, Yan Zhang and Heng ZhangLogic Programs with Ordered Disjunction: First-order Semantics and ExpressivenessKRJul 24 10:45
Angelos Charalambidis and Panos RondogiannisConstructive Negation in Extensional Higher-Order Logic ProgrammingKRJul 24 11:15
Marc Denecker and Joost VennekensThe Well-Founded Semantics Is the Principle of Inductive Definition, RevisitedKRJul 24 11:45
Amelia Harrison, Vladimir Lifschitz and Fangkai YangThe Semantics of Gringo and Infinitary Propositional FormulasKRJul 24 12:15
Federico Cerutti, Massimiliano Giacomin, Mauro Vallati and Marina ZanellaAn SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract ArgumentationKRJul 21 11:45
Sylvie Coste-Marquis, Sébastien Konieczny, Jean-Guy Mailly and Pierre MarquisOn the Revision of Argumentation Systems: Minimal Change of Arguments StatusesKRJul 21 11:15
Sylvie Doutre, Andreas Herzig and Laurent PerrusselA Dynamic Logic Framework for Abstract ArgumentationKRJul 21 12:15
Paul E. Dunne, Wolfgang Dvořák, Thomas Linsbichler and Stefan WoltranCharacteristics of Multiple Viewpoints in Abstract ArgumentationKRJul 21 10:45
Ronald De Haan and Stefan SzeiderThe Parameterized Complexity of Reasoning Problems Beyond NPKRJul 22 15:30
Igor RazgonOn OBDDs for CNFs of Bounded TreewidthKRJul 21 16:30
Hannes Strass and Johannes Peter WallnerAnalyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint TheoryKRJul 22 15:00
Guy Van den Broeck, Wannes Meert and Adnan DarwicheSkolemization for Weighted First-Order Model CountingKRJul 22 14:30
Patricia Everaere, Sébastien Konieczny and Pierre MarquisOn Egalitarian Belief MergingKRJul 21 15:00
Davide Grossi and Wiebe Van Der HoekJustified Beliefs by Justified ArgumentsKRJul 22 11:15
Andreas HerzigBelief Change Operations: A Short History of Nearly Everything, Told in Dynamic Logic of Propositional AssignmentsKRJul 22 11:45
Mehrdad Oveisi, James P. Delgrande, Francis Jeffry Pelletier and Fred PopowichBelief Change and Base DependenceKRJul 22 10:45
Pavlos Peppas and Mary-Anne WilliamsBelief Change and SemiordersKRJul 21 14:30
Claus-Peter Wirth and Frieder StolzenburgDavid Poole’s Specificity RevisedKRJul 21 15:30
Adam Bjorndahl, Joseph Halpern and Rafael PassAxiomatizing RationalityKRJul 24 11:45
Alexander BochmanDynamic Causal CalculusKRJul 24 10:45
Joseph HalpernAppropriate Causal Models and Stability of CausationKRJul 24 11:15
Egor Ianovski and Luke OngGuaranteeNash for Boolean games is NEXP-hardKRJul 24 12:15
Meghyn Bienvenu, Diego Calvanese, Magdalena Ortiz and Mantas SimkusNested Regular Path Queries in Description LogicsKRJul 21 11:15
Stefan Borgwardt, Felix Distel and Rafael PeñalozaDecidable Gödel Description Logics without the Finitely-Valued Model PropertyKRJul 23 12:15
Elena Botoeva, Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter and Michael ZakharyaschevQuery Inseparability for Description Logic Knowledge BasesKRJul 21 11:45
Andreas Ecke, Rafael Peñaloza and Anni-Yasmin TurhanAnswering Instance Queries Relaxed by Concept Similarity KRJul 21 12:15
Georg Gottlob, André Hernich, Clemens Kupke and Thomas LukasiewiczStable Model Semantics for Guarded Existential Rules and Description LogicsKRJul 23 10:45
Georg Gottlob, Marco Manna and Andreas PierisPolynomial Combined Rewritings for Existential RulesKRJul 21 10:45
Víctor Gutiérrez Basulto, Jean Christoph Jung and Thomas SchneiderLightweight Description Logics and Branching Time: a Troublesome MarriageKRJul 22 11:45
Yazmin Ibanez-Garcia, Carsten Lutz and Thomas SchneiderFinite Model Reasoning in Horn Description LogicsKRJul 22 11:15
Boris Konev, Carsten Lutz, Ana Ozaki Rivera Castillo and Frank WolterExact Learning of Lightweight Description Logic OntologiesKRJul 22 10:45
Markus Krötzsch and Sebastian RudolphNominal Schemas in Description Logics: Complexities ClarifiedKRJul 23 11:45
Michel Ludwig and Boris KonevPractical Uniform Interpolation and Forgetting for ALC TBoxes with Applications to Logical DifferenceKRJul 23 11:15
Leonid LibkinCertain Answers as Objects and KnowledgeKRJul 23 14:30
Fangzhen LinA Formalization of Programs in First-Order Logic with a Discrete Linear OrderKRJul 23 17:00
Loizos MichaelSimultaneous Learning and PredictionKRJul 23 15:30
Peter SchüllerTackling Winograd Schemas by Formalizing Relevance Theory in Knowledge GraphsKRJul 23 15:00
Shahab Tasharrofi and Eugenia TernovskaGeneralized Multi-Context SystemsKRJul 21 16:30
Peng Zhang and Jochen RenzQualitative Spatial Representation and Reasoning in Angry Bird: the Extended Rectangle AlgebraKRJul 21 17:00
Jorge Baier, Brent Mombourquette and Sheila McIlraithDiagnostic Problem Solving via Planning with Ontic and Epistemic GoalsKRJul 23 16:30
Francesco BelardinelliSatisfiability of Alternating-Time Temporal Epistemic Logic through TableauxKRJul 23 17:30
Julian Gutierrez, Paul Harrenstein and Michael WooldridgeReasoning about Equilibria in Game-Like Concurrent SystemsKRJul 21 15:00
Xiaowei Huang and Ron Van Der MeydenA Temporal Logic of Strategic KnowledgeKRJul 21 15:30
Alessio Lomuscio and Jakub MichaliszynAn Abstraction Technique for the Verification of Multi-Agent Systems against ATL SpecificationsKRJul 21 14:30
Vaishak Belle and Hector LevesqueHow To Progress Beliefs in Continuous DomainsKRJul 23 11:15
Christopher Ewin, Adrian Pearce and Stavros VassosTransforming Situation Calculus Action Theories for Optimised ReasoningKRJul 23 11:45
Babak Bagheri Hariri, Diego Calvanese, Alin Deutsch and Marco MontaliState-Boundedness in Data-Aware Dynamic SystemsKRJul 22 15:30
Gerhard Lakemeyer and Hector J. LevesqueDecidable Reasoning in a Fragment of the Epistemic Situation CalculusKRJul 22 14:30
Fangzhen LinA First-Order Semantics for Golog and ConGolog under a Second-Order Induction Axiom for SituationsKRJul 23 10:45
Alessio Lomuscio and Jakub MichaliszynModel Checking Unbounded Artifact-Centric SystemsKRJul 22 15:00
David Rajaratnam, Hector Levesque, Maurice Pagnucco and Michael ThielscherForgetting in ActionKRJul 23 12:15
Mehul Bhatt, Carl Schultz and Madhura ThosarComputing Narratives of Cognitive User Experience for Building Design Analysis: KR for Industry Scale Computer Aided Architecture DesignKRJul 23 14:30
Andrea Marrella, Massimo Mecella and Sebastian SardinaSmartPM: An Adaptive Process Management System through Situation Calculus, IndiGolog, and Classical PlanningKRJul 23 15:30
Matthias ThimmTweety: A Comprehensive Collection of Java Libraries for Logical Aspects of Artificial Intelligence and Knowledge RepresentationKRJul 23 15:00
Salem Benferhat and Karim TabiaReasoning with Uncertain Inputs in Possibilistic NetworksKRJul 23 17:00
Seyed Mehran Kazemi, David Buchman, Kristian Kersting, Sriraam Natarajan and David PooleRelational Logistic RegressionKRJul 23 17:30
Doga Kisa, Guy Van den Broeck, Arthur Choi and Adnan DarwicheProbabilistic Sentential Decision DiagramsKRJul 21 17:00
Nico PotykaLinear Programs for Measuring Inconsistency in Probabilistic LogicsKRJul 23 16:30
Guillaume AucherAxioms .2 and .4 as Interaction AxiomsKRJul 22 12:50
Michael Bartholomew and Joohyung LeeStable Models of Multi-Valued Formulas: Partial versus Total FunctionsKRJul 22 13:00
Wouter Beek, Stefan Schlobach and Frank van HarmelenRough Set Semantics for Identity on the WebKRJul 21 12:45
Vaishak Belle and Gerhard LakemeyerOn the Progression of Knowledge in Multiagent SystemsKRJul 22 12:25
Richard Booth, Edmond Awad and Iyad RahwanInterval Methods for Judgment Aggregation in ArgumentationKRJul 21 12:45
Pedro Cabalar and Martín DiéguezStrong Equivalence of Non-Monotonic Temporal TheoriesKRJul 22 12:20
Sofie De Clercq, Kim Bauters, Steven Schockaert, Martine De Cock and Ann NowéUsing Answer Set Programming for Solving Boolean GamesKRJul 22 12:50
James DelgrandeToward a Knowledge Level Analysis of ForgettingKRJul 22 12:35
Irene-Anna Diakidoy, Antonis Kakas, Loizos Michael and Rob MillerA Psychology-Inspired Approach to Automated Narrative Text ComprehensionKRJul 21 12:55
Felix Distel, Jamal Atif and Isabelle BlochConcept Dissimilarity with Triangle InequalityKRJul 21 12:55
Matt Duckham, Sanjiang Li, Weiming Liu and Zhiguo LongOn Redundant Topological Constraints (Extended Abstract)KRJul 22 12:15
Valmi Dufour-Lussier, Alice Hermann, Florence Le Ber and Jean LieberBelief Revision in the Propositional Closure of a Qualitative AlgebraKRJul 22 12:25
Sjur Kristoffer DyrkolbotnHow to Argue for Anything: Enforcing Arbitrary Sets of Labellings using AFsKRJul 21 12:50
Valeria Fionda, Claudio Gutierrez and Giuseppe PirróKnowledge Maps of Web GraphsKRJul 22 12:20
Martin Gebser, Tomi Janhunen and Jussi RintanenASP Encodings of Acyclicity PropertiesKRJul 22 12:55
Codruta Girlea, Eyal Amir and Roxana GirjuTracking Beliefs and Intentions in the Werewolf GameKRJul 22 12:45
Leora MorgensternRepresenting and Reasoning About Time Travel Narratives: Foundational ConceptsKRJul 22 12:40
Xavier Parent and Leon van der TorreAggregative Deontic Detachment for Normative ReasoningKRJul 22 12:55
Fabio Patrizi and Stavros VassosAction Theories over Generalized Databases with Equality Constraints (Extended Abstract)KRJul 22 12:35
Luis Moniz Pereira, Emmanuelle-Anna Dietz and Steffen HölldoblerAn Abductive Reasoning Approach to the Belief-Bias EffectKRJul 22 12:40
Márcio Ribeiro and Renata WassermannMinimal Change in AGM Revision for Non-Classical LogicsKRJul 22 12:30
Viachaslau Sazonau, Uli Sattler and Gavin BrownPredicting Performance of OWL Reasoners: Locally or Globally?KRJul 21 12:50
Yuping Shen and Xishun ZhaoCanonical Logic Programs are Succinctly Incomparable with Propositional FormulasKRJul 22 12:45
Andreas Sideris and Yannis DimopoulosHeuristic Guided Optimization for Propositional PlanningKRJul 22 12:30
Yi ZhouFirst-Order Default Logic RevisitedKRJul 22 12:15
Franz BaaderOntology-Based Monitoring of Dynamic SystemsKR
Georg Gottlob, Thomas Lukasiewicz and Andreas PierisDatalog+/–: Questions and AnswersKRJul 24 09:00
Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan and Luis QuesadaA Constraint-based Parallel Local Search for Disjoint Rooted Distance-Constrained Minimum Spanning Tree ProblemParSearchOptJul 18 12:15
Alejandro Arbelaez, Charlotte Truchet and Philippe CodognetOn the Parallelization of Randomized Propagation-based Constraint SolvingParSearchOptJul 18 11:45
Salvador Abreu, Danny Munera and Daniel DiazTowards a Parallel Hierarchical Adaptive Solver ToolParSearchOptJul 18 11:15
Federico Campeotto, Alessandro Dal Palù, Agostino Dovier, Ferdinando Fioretto and Enrico PontelliTowards a complete constraint solver on GPUParSearchOptJul 18 15:30
Long Guo, Said Jabbour, Jerry Lonlac and Lakhdar SaisA Portfolio Based Parallel SAT Solver with Multiple Deletion StrategiesParSearchOptJul 18 10:45
Michele BasaldellaInfinitary Classical Logic: Recursive Equations and Interactive SemanticsCLCJul 13 14:30
Emmanuel BeffaraA proof-theoretic view on scheduling in concurrencyCLCJul 13 11:30
David Cerna and Alexander LeitschCut-Elimination in Schematic Proofs and Herbrand SequentsCLCJul 13 15:20
Harley Eades Iii, Aaron Stump and Ryan McCleearyDualized Type TheoryCLCJul 13 11:10
José Espírito Santo, Ralph Matthes, Koji Nakazawa and Luís PintoConfluence for classical logic through the distinction between values and computationsCLCJul 13 12:30
Herman Geuvers, Wouter Geraedts, Bram Geron and Judith van StegerenA type system for Continuation CalculusCLCJul 13 12:00
Dominic HughesSeparable Sequent Calculus for First-order Classical Logic (Work in Progress)CLCJul 13 15:00
Kentaro Kikuchi and Takafumi SakuraiA Translation of Intersection and Union Types for the lambda-mu CalculusCLCJul 13 10:50
Bassel Mannaa and Thierry CoquandA sheaf model of the algebraic closureCLCJul 13 16:30
Koji NakazawaExtensional Models of Typed Lambda-mu CalculusCLCJul 13 10:00
Matthieu PerrinelStratified Nested Linear LogicCLCJul 13 15:40
Steffen van Bakel and Maria Grazia VigliottiA fully-abstract semantics of lambda-mu in the pi-calculusCLC
Jeremy Avigad, Johannes Hölzl and Luke SerafinA formally verified proof of the Central Limit TheoremIsabelleJul 13 08:45
Holger Blasum, Oto Havle, Bruno Langenstein, Yakoub Nemouchi, Julien Schmaltz, Werner Stephan, Sergey Tverdyshev, Freek Verbeek and Burkhart WolffUsing Isabelle/HOL to Develop and Maintain Separation Invariants for an Operating System (Extended Abstract)IsabelleJul 13 16:30
Florian Haftmann, Andreas Lochbihler and Wolfgang SchreinerTowards abstract and executable multivariate polynomials in IsabelleIsabelleJul 13 11:45
Ondřej Kunčar and Andrei PopescuFrom types to sets in Isabelle/HOLIsabelleJul 13 11:20
Peter LammichThe CAVA Automata LibraryIsabelleJul 13 10:55
Andreas Lochbihler and Marc ZüstProgramming TLS in Isabelle/HOLIsabelleJul 13 15:30
Tobias NipkowAmortized Complexity VerifiedIsabelleJul 13 17:40
Lars NoschinskiTowards Structured Proofs for Program Verification (Ongoing Work)IsabelleJul 13 17:20
Lars Noschinski and Christoph TrautPattern-based Subterm Selection In IsabelleIsabelleJul 13 09:45
Lorenz Panny, Jasmin Christian Blanchette and Dmitriy TraytelPrimitively (Co)recursive Definitions for Isabelle/HOLIsabelleJul 13 09:15
Lawrence PaulsonProving Gödel’s Incompleteness TheoremsIsabelleJul 13 14:30
Christine RizkallahA Simpl Shortest Path Checker VerificationIsabelleJul 13 17:00
Makarius WenzelIsabelle/jEdit NEWSIsabelleJul 13 15:00
Martin Avanzini and Bertram FelgenhauerType Introduction for Runtime Complexity AnalysisWSTJul 17 15:30
Alexander Bau, Rene Thiemann and Johannes WaldmannAutomated SAT Encoding for Termination Proofs with Semantic Labelling and UnlabellingWSTJul 18 11:45
Byron Cook, Heidy Khlaaf and Nir PitermanAbstract: Fairness for Infinite-State SystemsWSTJul 18 08:45
Byron Cook, Stephen Magill, Matthew Parkinson and Thomas StroederReducing Deadlock and Livelock Freedom to TerminationWSTJul 18 09:15
Nachum DershowitzAnother Proof for the Recursive Path OrderingWSTJul 18 15:30
Joerg Endrullis and Hans ZantemaNon-termination using Regular LanguagesWSTJul 17 09:45
Alfons GeserA Solution to Endrullis-08 and Similar ProblemsWSTJul 18 12:15
Alfons GeserKurth's Criterion H RevisitedWSTJul 18 15:00
Lars HellströmOrdering NetworksWSTJul 17 16:30
Dieter HofbauerOn the derivational complexity of Kachinuki orderingsWSTJul 18 14:30
Jeroen Ketema and Alastair DonaldsonAutomatic Termination Analysis for GPU KernelsWSTJul 17 12:15
Jan Leike and Matthias HeizmannGeometric Series as Nontermination Arguments for Linear Lasso ProgramsWSTJul 17 09:15
Naoki Nishida and Takumi KataokaOn Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop InvariantsWSTJul 17 11:45
Étienne Payet and Fred MesnardNon-termination of Dalvik bytecode via compilation to CLPWSTJul 17 08:45
Norbert Preining, Kazuhiro Ogata and Kokichi FutatsugiSpecifying and verifying liveness properties of QLOCK in CafeOBJWSTJul 18 09:45
Raphael Rodrigues, Péricles Alves, Fernando Pereira and Laure GonnordReal-world loops are easy to predict : a case studyWSTJul 17 15:00
Haruhiko Sato and Sarah WinklerA Satisfiability Encoding of Dependency Pair Techniques for Maximal CompletionWSTJul 18 11:15
Caterina Urban and Antoine MinéTo Infinity... and Beyond!WSTJul 17 14:30
Harald Zankl, Sarah Winkler and Aart MiddeldorpAutomating Elementary InterpretationsWSTJul 18 10:45
Slimane Abou-MsabahAn Enhanced Genetic Algorithm of the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock ProblemRCRAJul 18 12:40
Mario Alviano, Bernardo Cuteri and Francesco RiccaDeclarative Specification of Benchmark Sessions via ASPRCRAJul 17 12:40
Kerstin Bunte, Matti Järvisalo, Jeremias Berg, Petri Myllymäki, Jaakko Peltonen and Samuel KaskiOptimal Neighborhood Preserving Visualization by Maximum SatisfiabilityRCRAJul 17 10:50
Esra Erdem, Volkan Patoglu and Peter SchüllerA Systematic Analysis of Levels of Integration between High-Level Task Planning and Low-Level Feasibility ChecksRCRAJul 17 14:30
Eugene Freuder, Diarmuid Grimes and Richard WallaceDispensable Instantiations in Constraint Satisfaction ProblemsRCRAJul 18 09:45
Alexey Ignatiev, Antonio Morgado, Jordi Planes and Joao Marques-SilvaMaximal Falsifiability: Definitions, Algorithms, and ApplicationsRCRAJul 17 11:20
Amroun Kamal, Habbas Zineb and Aggoune-Mtalaa WassilaA compression algorithm to improve generalized hypertree decomposition-based solving approaches for large extensional non binary CSPRCRAJul 18 09:15
Luca Mancini, Alfredo Milani, Valentina Poggioni and Andrea ChianconeSelf Regulating Mechanisms for Network ImmunizationRCRAJul 18 12:20
Shashank Pathak, Luca Pulina and Armando TacchellaEvaluating Probabilistic Model Checking Tools for Verification of Robot Control PoliciesRCRAJul 18 11:50
Regis Riveret, Pascal Caianiello, Stefania Constantini and Moez DraiefConcept Learning by a Monte-Carlo Tree Search of ArgumentationsRCRAJul 18 11:20
Valentino Santucci, Marco Baioletti and Alfedo MilaniA Discrete Differential Evolution Algorithm for the Total Flowtime Flowshop Scheduling ProblemRCRAJul 17 15:00
Ilias Tachmazidis, Grigoris Antoniou and Wolfgang FaberEfficient Computation of the Well-Founded Semantics over Big DataRCRAJul 17 12:10
Richard WallaceNeighbourhood SAC for Preprocessing and SearchRCRAJul 18 10:45
Hans ZantemaLatin Squares with Graph PropertiesRCRAJul 17 11:50
Albert AtseriasWeak Pigeonhole Principles, Circuits for Approximate Counting, and Bounded-Depth ProofsPCJul 13 10:45
Fu Li and Iddo TzameretGenerating Matrix Identities and Hard Instances for Strong Proof SystemsPCJul 13 14:30
Jakob NordströmA (Biased) Survey of Space Complexity and Time-Space Trade-offs in Proof ComplexityPCJul 12 14:30
Pavel PudlákOn Some Conjectures in Proof ComplexityPCJul 12 11:00
James Aisenberg, Maria Bonet and Sam BussQuasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Finite SetsPCJul 13 09:15
Albert Atserias, Massimo Lauria and Jakob NordströmNarrow Proofs May Be Maximally LongPCJul 13 16:30
Ilario Bonacina, Nicola Galesi and Neil ThapenTotal Space in ResolutionPCJul 13 12:00
Hubie ChenBeyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint SatisfactionPCJul 12 12:30
Anupam Das$n^{O(\log \log n)}$ size monotone proofs of the weak pigeonhole principlePCJul 13 09:45
Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström and Marc VinyalsFrom Small Space to Small Width in ResolutionPCJul 13 12:30
Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström and Marc VinyalsTowards an Understanding of Polynomial Calculus: New Separations and Lower BoundsPCJul 12 15:30
Dmitry Itsykson and Dmitry SokolovLower bounds for splittings by linear combinationsPCJul 13 15:30
Emil JeřábekParameter-free induction in bounded arithmeticPCJul 12 17:00
Jan Johannsen, Massimo Lauria, Jakob Nordstrom and Marc VinyalsSize-Space Bounds and Trade-offs for CDCL ProofsPCJul 12 12:00
Ján PichLogical strength of complexity theory and a formalization of the PCP theorem in bounded arithmeticPCJul 12 17:30
Jean-Jose Razafindrakoto and Arnold BeckmannProvably Total Search Problems in Fragments of Bounded Arithmetic Below Polynomial-timePCJul 12 16:30
Neil Thapen, Arnold Beckmann and Pavel PudlákParity games and propositional proofsPCJul 13 17:00
Joerg Endrullis, Dimitri Hendriks, Jan Willem Klop and Andrew PolonskyAn Introduction to the Clocked Lambda CalculusWIRJul 12 16:30
Fanny He and Alexis SaurinFrom the finite to the transfinite: Λμ-terms and streams.WIRJul 12 15:00
Stefan Kahrs and Connor SmithNormal Forms and InfinityWIR
Jakob Grue SimonsenDynamical systems, attractors and well-behaved infinitary rewritingWIRJul 12 14:30
Benoît Valiron and Michele PaganiWork in Progress: Algebraic Abstract Reduction SystemsWIRJul 12 17:00
Hans ZantemaTurtle graphics of morphic streamsWIRJul 12 17:30
Carlos Bobed, Fernando Bobillo, Roberto Yus, Guillermo Esteban and Eduardo MenaAndroid Went Semantic: Time for EvaluationOREJul 13 12:40
Michel LudwigJust: a Tool for Computing Justifications w.r.t. ELH OntologiesOREJul 13 12:20
Jean-Rémi Bourguet and Luca PulinaTROvE: a Graphical Tool to Evaluate OWL ReasonersOREJul 13 11:00
José Antonio Minarro-Giménez and Matthias SamwaldAn update on Genomic CDS, a complex ontology for pharmacogenomics and clinical decision supportOREJul 13 14:50
Diego Calvanese, Davide Lanti, Martin Rezk, Mindaugas Slusnys and Guohui XiaoA Scalable Benchmark for OBDA Systems: Preliminary ReportOREJul 13 11:40
Michele Ruta, Floriano Scioscia, Giuseppe Loseto, Filippo Gramegna, Saverio Ieva and Eugenio Di SciascioMini-ME 2.0: powering the Semantic Web of ThingsOREJul 13 16:30
Dmitry TsarkovIncremental and Persistent Reasoning in FaCT++OREJul 13 16:50
Alexander KropotinEvaluating OWL 2 Reasoners in the Context Of Checking Entity-Relationship Diagrams During Software DevelopmentOREJul 13 12:00
C. Maria Keet, Claudia D'Amato, Zubeida Khan and Agnieszka LawrynowiczExploring Reasoning with the DMOP OntologyOREJul 13 14:30
Thomas Eiter, Patrik Schneider, Mantas Simkus and Guohui XiaoUsing OpenStreetMap Data to Create Benchmarks for Description Logic ReasonersOREJul 13 11:20
Robert Stevens, Nicolas Matentzoglu and Uli SattlerA Family History Knowledge Base in OWL 2 OREJul 13 15:10
Riccardo ZeseReasoning with Probabilistic LogicsICLPJul 20 12:35
Grzegorz JaśkiewiczLogic Programming as Scripting Language for Bots in Computer Games – Research OverviewICLPJul 20 16:55
Aya SaadCDF-Intervals: A Reliable Framework to Reason about Data with UncertaintyICLPJul 20 15:20
Heike StephanApplication of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic ProgramsICLPJul 20 14:30
Nada Sharaf, Slim Abdennadher and Thom Fr¨uhwirthVisualization of Constraint Handling RulesICLPJul 20 12:10
Rehan Abdul AzizBound Founded Answer Set ProgrammingICLPJul 20 14:55
Joachim JansenModel revision inference for extensions of first order logicICLPJul 20 16:30
Michael MorakThe Impact of Disjunction on Reasoning under Existential Rules: Research SummaryICLPJul 20 11:45
Ulrich Berger and Tie HouProgram extraction in Church's simple theory of types (invited talk)PSCJul 18 09:15
Henning Basold and Helle Hvid HansenObservational Equivalence for Behavioural Differential EquationsPSCJul 17 16:30
Stefano Berardi, Paulo Oliva and Silvia SteilaEffective Bounds on the Podelski-Rybalchenko Termination TheoremPSCJul 17 15:15
Ulrich Berger, Alison Jones and Monika SeisenbergerExtracting Monadic Parsers from ProofsPSCJul 18 10:45
Liron Cohen and Robert ConstableIntuitionistic Ancestral LogicPSCJul 18 11:30
Christian Espindola and Henrik ForssellConstructive completeness and exploding modelsPSCJul 17 10:45
Mauro Ferrari and Camillo FiorentiniProof-search in natural deduction calculi for IPLPSCJul 18 14:30
Herman GeuversA typed lambda-calculus with call-by-name and call-by-value iterationPSCJul 17 14:30
Hugo Herbelin and Danko IlikComputing with Gödel’s completeness theoremPSCJul 17 11:30
Sergey MelikhovA joint logic of problems and propositions, a modified BHK-interpretation and proof-relevant topological models of intuitionistic logicPSCJul 18 15:15
Tatiana Yavorskaya and Nadezhda RuhlyadkoMulti-agent justification logicPSCJul 17 17:15
Andrew GillHERMIT: An Equational Reasoning Model to Implementation Rewrite System for HaskellWPTEJul 13 09:15
William Mansky and Elsa GunterVerifying Optimizations for Concurrent ProgramsWPTEJul 13 10:45
Masanori Nagashima, Tomofumi Kato, Masahiko Sakai and Naoki NishidaInverse Unfold Problem and Its Heuristic SolvingWPTEJul 13 11:15
David SabelStructural Rewriting in the Pi-CalculusWPTEJul 13 12:00
Guillaume Madelaine, Cedric Lhoussaine and Joachim NiehrenAttractor Equivalence: An Observational Semantics for Reaction NetworksWPTEJul 13 12:30
Naoki Nishida, Makishi Yanagisawa and Karl GmeinerOn Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using UnravelingsWPTEJul 13 14:30
Manfred Schmidt-Schauss and David SabelContextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)WPTEJul 13 15:00
Yuki ChibaVerifying the Correctness of Tupling Transformations based on Conditional RewritingWPTEJul 13 15:30
Karl Gmeiner and Naoki NishidaNotes on Structure-Preserving Transformations of Conditional Term Rewrite SystemsWPTEJul 13 16:30
Georg Moser and Michael SchaperA Complexity Preserving Transformation from Jinja Bytecode to Rewrite SystemsWPTEJul 13 17:00
Michael BenediktNew Perspectives on Query ReformulationDLJul 17 10:45
Patrick BlackburnFragments of Logic, Language, and ComputationDLJul 18 08:45
Alon HalevyStructured Data on the Web (or, a Personal Journey Away From and Back To Ontologies)DLJul 19 10:45
Shqiponja Ahmetaj, Diego Calvanese, Magdalena Ortiz and Mantas SimkusPlanning Problems for Graph Structured Data in Description LogicsDLJul 19 18:05
Albin Ahmeti, Diego Calvanese and Axel PolleresSPARQL Update for Materialized Triple Stores under DL-Lite_RDFS EntailmentDLJul 20 12:00
Alessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav Ryzhikov, Frank Wolter and Michael ZakharyaschevTemporal OBDA with LTL and DL-LiteDLJul 18 12:00
Franz Baader and Barbara MorawskaMatching with respect to general concept inclusions in the Description Logic ELDLJul 17 17:40
Meghyn Bienvenu, Stanislav Kikot and Vladimir PodolskiiSuccinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like QueriesDLJul 18 17:05
Stefan BorgwardtFuzzy DLs over Finite Lattices with NominalsDLJul 18 14:55
Stefan Borgwardt, José A. Leyva Galano and Rafael PeñalozaGödel FL_0 with Greatest Fixed-Point SemanticsDLJul 18 14:30
Elena Botoeva, Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter and Michael ZakharyaschevQuery Inseparability by GamesDLJul 19 14:30
Camille Bourgaux, Meghyn Bienvenu and François GoasdouéQuerying Inconsistent Description Logic Knowledge Bases under Preferred Repair SemanticsDLJul 18 11:35
Pierre Bourhis, Michael Morak and Andreas PierisAcyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLsDLJul 17 11:45
Loris Bozzato, Thomas Eiter and Luciano SerafiniContextualized Knowledge Repositories with Justifiable ExceptionsDLJul 17 18:05
Diego Calvanese, Tomer Kotek, Mantas Simkus, Helmut Veith and Florian ZulegerShape and Content: Incorporating Domain Knowledge into Shape AnalysisDLJul 17 15:20
David Carral, Cristina Feier, Ana Armas Romero, Bernardo Cuenca-Grau, Pascal Hitzler and Ian HorrocksIs Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLsDLJul 17 14:30
Bernardo Cuenca Grau, Evgeny Kharlamov, Egor Kostylev and Dmitriy ZheleznyakovControlled Query Evaluation over Lightweight OntologiesDLJul 20 10:45
Bernardo Cuenca Grau, Evgeny Kharlamov, Dmitriy Zheleznyakov, Marcelo Arenas and Sarunas MarciuskaOn Faceted Search over Knowledge BasesDLJul 19 11:45
Chiara Del Vescovo and Rafael PeñalozaDeaLing with Ontologies using CODsDLJul 20 09:50
Thomas Eiter, Michael Fink and Daria StepanovaTowards Practical Deletion Repair of Inconsistent DL-programsDLJul 18 10:45
William Gatens, Boris Konev and Frank WolterLower and Upper Approximations for Depleting Modules of Description Logic OntologiesDLJul 20 09:00
Birte Glimm, Yevgeny Kazakov, Thorsten Liebig, Trung-Kien Tran and Vincent VialardAbstraction Refinement for Ontology MaterializationDLJul 17 14:55
Peter Hansen, Carsten Lutz, Inanc Seylan and Frank WolterQuery Rewriting under EL TBoxes: Efficient AlgorithmsDLJul 20 11:10
Mark Kaminski, Yavor Nenov and Bernardo Cuenca GrauDatalog Rewriting Techniques for Non-Horn OntologiesDLJul 18 16:40
Yevgeny Kazakov and Pavel KlinovGoal-Directed Tracing of Inferences in EL OntologiesDLJul 17 16:50
Szymon Klarman and Thomas MeyerComplexity of Temporal Query Abduction in DL-LiteDLJul 18 12:25
Patrick Koopmann and Renate A. SchmidtForgetting and Uniform Interpolation for ALC-Ontologies with ABoxesDLJul 19 15:20
Egor V. Kostylev, Juan L. Reutter and Domagoj VrgocXPath for DL-Lite OntologiesDLJul 20 12:25
Markus Krötzsch and Sebastian RudolphComplexities of Nominal SchemasDLJul 17 12:10
Michel Ludwig and Rafael PeñalozaBrave and Cautious Reasoning in ELDLJul 17 17:15
Michel Ludwig and Dirk WaltherDetecting Conjunctive Query Differences between ELHr-Terminologies using HypergraphsDLJul 19 14:55
Francisco Martin-Recuerda and Dirk WaltherAxiom Dependency Hypergraphs for fast Atomic Decomposition of OntologiesDLJul 20 09:25
Boris Motik, Yavor Nenov, Robert Piro, Ian Horrocks and Dan OlteanuParallel OWL 2 RL Materialisation in Centralised, Main-Memory RDF SystemsDLJul 20 11:35
Andreas Steigmiller, Birte Glimm and Thorsten LiebigOptimised Absorption for Expressive Description LogicsDLJul 19 17:40
Giorgos Stoilos and Giorgos StamouHybrid Query Answering Over DL OntologiesDLJul 19 17:15
David Toman and Grant WeddellPushing the CFDnc EnvelopeDLJul 19 12:10
Yujiao Zhou, Yavor Nenov, Bernardo Cuenca Grau and Ian HorrocksPay-as-you-go Ontology Query Answering Using a Datalog ReasonerDLJul 19 16:50
Tahani Alsubait, Bijan Parsia and Uli SattlerMeasuring Conceptual Similarity in Ontologies: How Bad is a Cheap Measure?DLJul 18 15:41
Fernando Bobillo and Umberto StracciaA MILP-based decision procedure for the (Fuzzy) Description Logic ALCBDLJul 18 15:20
Stefan Borgwardt, Felix Distel and Rafael PeñalozaGödel Description Logics with General ModelsDLJul 18 15:26
Pierre Bourhis, Markus Krötzsch and Sebastian RudolphHow to Best Nest Regular Path QueriesDLJul 17 12:50
Diego Calvanese, Wolfgang Fischl, Reinhard Pichler, Emanuel Sallinger and Mantas SimkusExpressive Identification Constraints to Capture Functional Dependencies in Description LogicsDLJul 19 12:47
Marco Cerami and Umberto StracciaComplexity sources in FDLDLJul 18 15:23
Federico Cerutti, Geeth de Mel, Timothy Norman, Nir Oren, Artemis Parvizi, Paul Sullivan and Alice TonioloObfuscation of Semantic Data: Restricting the Spread of Sensitive InformationDLJul 18 15:38
Ismail Ilkan Ceylan and Rafael PeñalozaBayesian Description LogicsDLJul 18 15:32
Liang Chang, Uli Sattler and Tianlong GuAn ABox Revision Algorithm for the Description Logic $\mathcal{EL_{\bot}}$DLJul 17 15:45
Jieying Chen, Michel Ludwig, Yue Ma and Dirk WaltherEvaluation of Extraction Techniques for Ontology ExcerptsDLJul 19 12:56
Marco Console, Domenico Lembo, Valerio Santarelli and Domenico Fabio SavoGraphol: Ontology representation through diagramsDLJul 19 12:41
Marco Console and Maurizio LenzeriniReducing Global Consistency to Local Consistency in Ontology-based Data Access - Extended AbstractDLJul 19 12:44
Ali Rezaei DivroodiComparing the Expressiveness of Description LogicsDLJul 17 12:35
Ala Djeddai, Hassina Seridi and Tarek KhadirReasoning about Belief Uncertainty in DL Lite N boolDLJul 18 15:35
Andreas Ecke, Rafael Peñaloza and Anni-Yasmin TurhanMary, What's Like All Cats?DLJul 18 15:44
Fredrik Engström, Abdul Rahim Nizamani and Claes StrannegårdGenerating Comprehensible Explanations in Description LogicDLJul 19 15:48
Laura Giordano, Valentina Gliozzi, Nicola Olivetti and Gian Luca PozzatoRational closure in SHIQDLJul 17 15:54
Ken Halland, Arina Britz and Szymon KlarmanTBox abduction in ALC using a DL tableauDLJul 19 15:45
Martin Homola, Jan Kluka, Vojtěch Svátek and Miroslav VacuraTyped Higher-Order Variant of SROIQ - Why Not?DLJul 17 12:53
Yevgeny Kazakov and Pavel KlinovBridging the Gap between Tableau and Consequence-Based ReasoningDLJul 17 12:44
Tomer Kotek, Mantas Simkus, Helmut Veith and Florian ZulegerTowards a Description Logic for Program Analysis: Extending ALCQIO with ReachabilityDLJul 17 12:47
Domenico Lembo, Riccardo Rosati, Marco Ruzzi, Domenico Fabio Savo and Emanuele TocciVisualization and management of mappings in ontology-based data access (progress report)DLJul 19 12:38
Maurizio Lenzerini, Lorenzo Lepore and Antonella PoggiPractical query answering over Hi (DL-LiteR) knowledge basesDLJul 17 12:56
Jared Leo, Ulrike Sattler and Bijan ParsiaTemporalising EL Concepts with Time IntervalsDLJul 18 12:50
Yue Ma and Rafael PeñalozaTowards Parallel Repair: An Ontology Decomposition-based ApproachDLJul 19 15:54
Yuri Malheiros and Fred FreitasA Method to Develop Description Logic Ontologies Iteratively with Automatic Requirement TraceabilityDLJul 19 12:53
Nicolas Matentzoglu, Bijan Parsia and Uli SattlerAn Empirical Investigation of Difficulty of Subsets of Description Logic OntologiesDLJul 17 12:38
Kody Moodley, Thomas Meyer and Uli SattlerDIP: A Defeasible-Inference Platform for OWL OntologiesDLJul 17 15:57
E. A. Nasubo Ongoma, C. Maria Keet and Thomas MeyerTransition Constraints for Temporal AttributesDLJul 18 12:53
Özgür Lütfü Özcep, Ralf Möller and Christian NeuenstadtA Stream-Temporal Query Language for Ontology Based Data AccessDLJul 18 12:56
Rafael Peñaloza, Veronika Thost and Anni-Yasmin TurhanCertain Answers in a Rough WorldDLJul 18 15:29
Viachaslau Sazonau, Uli Sattler and Gavin BrownPredicting OWL Reasoners: Locally or Globally?DLJul 17 12:41
Ahmet Soylu, Evgeny Kharlamov, Dmitriy Zheleznyakov, Ernesto Jimenez-Ruiz, Martin Giese and Ian HorrocksOptiqueVQS: Visual Query Formulation for OBDADLJul 19 12:35
Giorgos StoilosOBDA Using RL Reasoners and RepairingDLJul 19 12:50
Zhe Wang, Kewen Wang, Guilin Qi, Zhiqiang Zhuang and Yuefeng LiInstance-driven TBox Revision in DL-LiteDLJul 17 15:48
Zhiqiang Zhuang, Zhe Wang, Kewen Wang and Grigoris AntoniouRational Elimination of DL-Lite TBox AxiomsDLJul 17 15:51
Bruno BuchbergerThe Theorema Approach to MathematicsPASJul 17 14:30
Hoon HongTest-Input Generation using Computational Real Algebraic GeometryPASJul 18 09:15
Michael RusinowitchAutomated verification of security protocols and servicesPASJul 18 14:30
Viorica Sofronie-StokkermansHierarchical reasoning and quantifier elimination for the verification of parametric reactive and hybrid systemsPASJul 17 09:00
Sandra Alves, Besik Dundua, Mario Florido and Temur KutsiaConfluence of Pattern-Based Calculi with Finitary MatchingPASJul 17 17:00
Xiaoyu Chen and Jie LuoRCK: A Software Toolkit for R-calculusPASJul 17 12:00
Stefan Ciobaca, Dorel Lucanu, Vlad Rusu and Grigore RosuProgramming Language Aggregation with Applications in Equivalence CheckingPASJul 18 17:30
Isabela DramnescSynthesis of Algorithms on Sets Represented as Monotone ListsPASJul 18 10:45
Xiaomei Hou, Mengxiang Lin and Tahir JameelA hybrid path constraint solver combined with meta-heuristic searchPASJul 18 16:30
Hao Huang, Fangmin Song, Zhengjiang Qian, Kangjie Li, Jiang Chen, Shuiwang Guan and Wei HuangVTOS: A Finite State Machine Model of OS and Formalized Verification of Its MicrokernelPASJul 18 11:45
Dongchen JiangThe Verification of Conversion Algorithms between Finite AutomataPASJul 17 17:30
Jens Knoop, Laura Kovacs and Jakob ZwirchmayrSuccessfully Coping with Scalability of Symbolic Analysis in Timing AnalysisPASJul 17 16:30
Alexander Letichevsky, Oleksandr Letychevskyi, Vladimir Peschanenko and Thomas WeigertNew predicate transformer for symbolic modelingPASJul 18 11:15
Wei LiAn Attempt to Formalize Popper's Logic of Scientific DiscoveryPASJul 17 10:45
Kristjan Liiva, Grant Passmore and Paul JacksonA note on real quantifier elimination by virtual term substitution of unbounded degreePASJul 17 15:00
Jie Luo and Wei LiA Model Theory for R-calculus without CutPASJul 17 11:30
Jakob PraherSymbolic Problem Solving With Bidirectional Executable RepresentationsPASJul 18 12:15
George Stergiopoulos, Panagiotis Katsaros and Dimitris GritzalisSource code profiling and classification for automated detection of logical errorsPASJul 17 18:00
Sorin StratulatBuilding explicit induction schemas for cyclic induction reasoningPASJul 18 15:30
Farn Wang, Pin Hsiuan Chen and Wen-Hong ChiangAutomatic App Testing of LTL Properties PASJul 18 17:00
Erman Acar and Christian MeilickeMulti-Attribute Decision Making using Weighted Description LogicsPRUVJul 23 17:30
Eva ArmengolLearning Preferences for CollaborationPRUVJul 23 16:30
Libor BehounekIn Which Sense Is Fuzzy Logic a Logic for Vagueness?PRUVJul 23 10:45
Christoph Beierle, Markus Höhnerbach and Marcus MartoGeneration of Parametrically Uniform Knowledge Bases in a Relational Probabilistic Logic with Maximum Entropy SemanticsPRUVJul 24 11:45
Stefan Borgwardt, Marco Cerami and Rafael PeñalozaMany-valued Horn Logic is HardPRUVJul 23 15:30
Arina Britz and Ivan VarzinczakTowards a Logic of DilationPRUVJul 23 11:45
Tommaso Di Noia, Thomas Lukasiewicz, Maria Vanina Martinez, Gerardo Simari and Oana Tifrea-MarciuskaComputing k-Rank Answers with Ontological CP-NetsPRUVJul 23 17:00
Andreas EckeSimilarity-based Relaxed Instance Queries in EL++PRUVJul 23 14:30
Joohyung Lee and Yi WangStable Models of Fuzzy Propositional FormulasPRUVJul 23 11:15
Thomas Lukasiewicz, Maria Vanina Martinez, Cristian Molinaro, Livia Predoiu and Gerardo SimariAnswering Ontological Ranking Queries Based on Subjective ReportsPRUVJul 24 10:45
David MitchellResolution and Clause Learning for Multi-Valued CNF FormulasPRUVJul 23 15:00
Matt Kaufmann and J MooreEnhancements to ACL2 in Versions 6.2, 6.3, and 6.4ACL2Jul 12 09:30
Jared Davis and Matt KaufmannIndustrial-Strength Documentation for ACL2ACL2Jul 12 09:00
Harsh Raju Chamarthi, Peter Dillinger and Panagiotis ManoliosData Definitions in ACL2 SedanACL2Jul 12 11:45
Benjamin Selfridge and Eric SmithPolymorphic Types In ACL2ACL2Jul 12 11:15
Jónathan Heras and Ekaterina KomendantskayaACL2(ml): Machine-Learning for ACL2ACL2Jul 12 12:15
Sebastiaan Joosten, Cezary Kaliszyk and Josef UrbanExperiments with TPTP-style Automated Theorem Provers on ACL2 ProblemsACL2Jul 12 10:45
Ruben Gamboa and John CowlesOn Vickrey's Theorem and the Use of ACL2 for Formal Reasoning in EconomicsACL2Jul 12 16:30
John Cowles and Ruben GamboaEquivalence of the Traditional and Non-Standard Definitions of Concepts from Real AnalysisACL2Jul 13 09:30
Ruben Gamboa and John CowlesFormal Verification of Medina's Sequence of Polynomials for Approximating ArctangentACL2Jul 13 09:00
Disha Puri, Sandip Ray, Kecheng Hao and Fei XieUsing ACL2 to Verify Loop Pipelining in Behavioral SynthesisACL2Jul 13 12:15
Benjamin SelfridgeAn ACL2 Mechanization of an Axiomatic Framework for Weak MemoryACL2Jul 13 11:45
David Russinoff and John O'LearyModeling Algorithms in SystemC and ACL2ACL2Jul 13 10:45
David Hardin, Jennifer Davis, David Greve and Jedidiah McClurgDevelopment of a Translator from LLVM to ACL2ACL2Jul 13 11:15
Mnacho Echenim, Nicolas Peltier and Sophie TourretA Superposition-Based Approach to Abductive Reasoning in Equational Clausal LogicADDCTJul 18 10:45
Paula Chocron, Pascal Fontaine and Christophe RingeissenSatisfiability Modulo Non-Disjoint Combinations of Theories Connected via Bridging FunctionsADDCTJul 18 12:00
Zvonimir Pavlinovic, Tim King and Thomas WiesFinding Minimum Type Error SourcesADDCTJul 18 12:30
Joseph Boudou and Philippe BalbianiDecidability of Iteration-free PDL with Parallel CompositionADDCTJul 18 14:30
Renate A. Schmidt, John Stell and David RydeheardAxiomatic and Tableau-Based Reasoning for Kt(H,R)ADDCTJul 18 15:00
Domenico Cantone, Joanna Golinska-Pilarek and Marianna Nicolosi-AsmundoOn Dual Tableau-Based Decision Procedures for Relational FragmentsADDCTJul 18 15:30
Vincent van Oostrom and Femke van RaamsdonkThe dynamic pattern calculus as a higher-order pattern rewriting systemHORJul 12 08:45
Beniamino Accattoli, Pablo Barenbaum and Damiano MazzaDistilling Abstract Machines (Extended Abstract)HORJul 12 09:15
Kristoffer RoseExperience with Higher Order Rewriting from the Compiler Teaching TrenchesHORJul 12 09:45
Cynthia KopThe Higher-Order Dependency Pair FrameworkHORJul 12 10:45
Vincent Van OostromFeebly not weaklyHORJul 12 11:15
Leonardo De Moura and Dejan JovanovićA Model-Constructing Satisfiability CalculusSATJul 16 14:30
Jakob NordstromA (Biased) Proof Complexity Survey for SAT PractitionersSATJul 15 14:30
Nina Narodytska and Fahiem BacchusCores in Core based MaxSat Algorithms: an AnalysisSATJul 14 11:45
Jan Arne Telle, Sigve Hortemo Sæther and Martin VatshelleSolving MaxSAT and #SAT on structured CNF formulasSATJul 14 11:15
Takayuki Sakai, Kazuhisa Seto and Suguru TamakiSolving Sparse Instances of Max SAT via Width Reduction and Greedy RestrictionSATJul 14 10:45
Anton Belov, Marijn Heule and Joao Marques-SilvaMUS Extraction using Clausal ProofsSATJul 14 12:40
Joao Marques-Silva and Alessandro PrevitiOn Computing Preferred MUSes and MCSesSATJul 14 12:10
Matti Järvisalo and Janne H. KorhonenConditional Lower Bounds for Failed Literals and Related TechniquesSATJul 14 15:30
Ronald de Haan and Stefan SzeiderFixed-Parameter Tractable Reductions to SATSATJul 14 14:30
Alexey Ignatiev, Antonio Morgado and Joao Marques-SilvaOn Reducing Maximum Independent Set to Minimum SatisfiabilitySATJul 14 15:00
Mladen Miksa and Jakob NordstromLong Proofs of (Seemingly) Simple FormulasSATJul 15 10:45
Gabriel Istrate and Adrian CrăciunProof complexity and the Lovasz-Kneser Theorem (I)SATJul 15 11:15
Valeriy Balabanov, Magdalena Widl and Jie-Hong Roland JiangQBF Resolution Systems and their Proof ComplexitiesSATJul 15 16:30
Oliver Kullmann and Olaf BeyersdorffUnified characterisations of resolution hardness measuresSATJul 15 15:30
Tomohiro Sonobe, Shuya Kondoh and Mary InabaCommunity Branching for Parallel Portfolio SAT SolversSATJul 15 12:20
Laurent Simon and Gilles AudemardLazy clause exchange policy for parallel SAT solversSATJul 15 12:40
Alexander Nadel, Ofer Strichman and Vadim RyvchinUltimately Incremental SATSATJul 15 11:50
Boris Konev and Alexei LisitsaA SAT Attack on the Erdos Discrepancy ConjectureSATJul 16 10:45
Tamir Heyman, Dan Smith, Lance Leong, Husam Abu-Haimed and Yogesh MahajanDominant Controllability Check Using QBF-Solver and Netlist OptimizerSATJul 16 11:05
Bernd Finkbeiner and Leander TentrupFast DQBF RefutationSATJul 16 11:35
Zack Newsham, Vijay Ganesh, Sebastian Fischmeister, Gilles Audemard and Laurent SimonImpact of Community Structure on SAT Solver PerformanceSATJul 16 12:30
Friedrich Slivovsky and Stefan SzeiderVariable Dependencies and Q-ResolutionSATJul 16 12:00
Armin Biere, Daniel Le Berre, Emmanuel Lonca and Norbert MantheyDetecting cardinality constraints in CNFSATJul 16 17:30
Adrian Balint, Armin Biere, Andreas Fröhlich and Uwe SchöningEfficient implementation of SLS solvers and new heuristics for k-SAT with long clausesSATJul 16 15:30
Tomáš Balyo, Andreas Fröhlich, Marijn Heule and Armin BiereEverything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask)SATJul 16 16:30
Daniel Larraz, Albert Oliveras, Enric Rodríguez Carbonell and Albert RubioMinimal-Model-Guided Approaches to Solving Polynomial Constraints and ExtensionsSATJul 17 10:45
Yoav Fekete and Michael CodishSimplifying Pseudo-Boolean Constraints in Residual Number SystemsSATJul 16 17:00
Oliver GableskeAn Ising Model inspired Extension of the Product-based MP Framework for SATSATJul 17 11:15
Andrei Bulatov and Cong WangApproximating highly satisfiable random 2-SATSATJul 17 11:45
Florent Capelli, Arnaud Durand and Stefan MengelHypergraph Acyclicity and Propositional Model CountingSATJul 17 12:15
Carles Creus, Pau Fernández and Guillem GodoyAutomatic Evaluation of Reductions between NP-complete ProblemsSATJul 14 17:10
Nathan Wetzler, Marijn Heule and Warren HuntDRAT-trim: Efficient Checking and Trimming Using Expressive Clausal ProofsSATJul 14 16:50
Charles Jordan, Lukasz Kaiser, Florian Lonsing and Martina SeidlMPIDepQBF: Towards Parallel QBF Solving without Knowledge SharingSATJul 14 16:30
Ruben Martins, Vasco Manquinho and Ines LynceOpen-WBO: a Modular MaxSAT SolverSATJul 14 17:30
Konstantin KorovinInstantiation-based reasoning, EPR encodings and all thatLaShJul 18 09:00
Peter StuckeyLaziness is next to GodlinessLaShJul 18 14:30
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher and Stefan WoltranThe D-FLAT System for Dynamic Programming on Tree DecompositionsLaShJul 18 16:30
Broes De Cat, Marc Denecker, Peter Stuckey, Maurice Bruynooghe and Bart BogaertsLazy Model Expansion: Interleaving Grounding with SearchLaShJul 18 15:30
Tomi JanhunenCross-Translating Answer Set ProgramsLaShJul 18 17:10
Jeremias Berg, Matti Järvisalo and Brandon MaloneLearning Optimal Bounded Treewidth Bayesian Networks via Maximum SatisfiabilityLaShJul 18 12:15
Bart Bogaerts, Joachim Jansen, Broes De Cat, Gerda Janssens, Maurice Bruynooghe and Marc DeneckerMeta-level Representations in the IDP Knowledge Base System: Bootstrapping Inference Engine DevelopmentLaShJul 18 10:45
Emir Demirović and Nysret MusliuModeling High School Timetabling as PartialWeighted maxSATLaShJul 18 11:45
Shahab Tasharrofi and Eugenia TernovskaLogical Machinery of Heuristics (Preliminary Report)LaShJul 18 11:15
Gilles DowekSimply Typed Lambda-Calculus Modulo Type IsomorphismsSDJul 12 09:15
Rosalie IemhoffCompletions and the Schuette methodSDJul 12 10:45
Kazushige TeruiProof theory for ordered algebra: amalgamation and densificationSDJul 12 14:30
Marc Bagnol, Amina Doumane and Alexis SaurinA Correctness Criterion Free from SwitchingsSDJul 12 11:45
Taus Brock-NannestadSubstructural Cut EliminationSDJul 12 16:30
Christophe Fouqueré and Myriam QuatriniMultiplicative Decomposition of Behaviours in LudicsSDJul 12 17:00
Dominic HughesFirst-order Proofs Without Syntax: Summary of Work in ProgressSDJul 12 12:15
Marie KerjeanWeak topologies for Linear LogicSDJul 12 15:30
Orna GrumbergSAT-Based Model Checking with InterpolationiPRAJul 17 10:45
Pavel PudlakFeasible Interpolation in Proof Systems based on Integer Linear ProgrammingiPRAJul 17 14:30
Frank WolterInterpolation in Description Logic: A SurveyiPRAJul 18 09:00
Niklas Een, Alexander Legg, Nina Narodytska and Leonid RyzhykInterpolants in Two-Player GamesiPRAJul 17 12:00
Chanseok Oh, Martin Schäf, Daniel Schwartz-Narbonne and Thomas WiesFault Localization using InterpolationiPRAJul 17 12:30
David Toman and Grant WeddellOn Enumerating Query Plans via Interpolants from Tableau Proofs (abstract)iPRAJul 17 16:30
Christoph WernhardApplication Patterns of Projection/ForgettingiPRAJul 17 17:00
Ahmed Mahdi and Martin FränzleGeneralized Craig Interpolation for Stochastic Satisfiability Modulo Theories ProblemsiPRAJul 17 17:30
Patrick Koopmann and Renate A. SchmidtResolution Based Uniform Interpolation for Expressive Description LogicsiPRAJul 18 10:45
Alexander Legg, Nina Narodytska and Leonid RyzhykPractical CNF Interpolants Via BDDsiPRAJul 18 11:15
Enrico Franconi, Paolo Guagliardo, Volha Kerhet and Nhung NgoInterpolation and Domain Independence applied to DatabasesiPRAJul 18 11:45
Georg Schadler and Georg HofferekTree-based Modular SMT SolvingiPRAJul 18 12:15
Marco Rocchetto, Luca Viganò and Marco VolpeUsing Interpolation for the Verification of Security Protocols (Extended Abstract)iPRAJul 18 14:30
Kenneth McMillanInterpolation StrategiesiPRAJul 18 15:00
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Lukas Holik, Ahmed Rezine, Philipp Ruemmer and Jari StenmanTowards Craig Interpolation for String ConstraintsiPRAJul 18 15:30
Aws Albarghouthi, Isil Dillig, Arie Gurfinkel and Marsha ChechikSpecification Synthesis via Generalized AbductioniPRAJul 18 16:30
Yakir Vizel and Arie GurfinkelInterpolants from Clausal ProofsiPRAJul 18 17:00
Clark BarrettSMT: Where do we go from here?SMTJul 17 09:15
Daniel J. Fremont and Sanjit A. SeshiaSpeeding Up SMT-Based Quantitative Program AnalysisSMTJul 17 10:45
Hristina Palikareva and Cristian CadarMulti-solver Support in Symbolic ExecutionSMTJul 17 11:15
Mats Carlsson, Olga Grinchtein and Justin PearsonProtocol Log Analysis with Constraint ProgrammingSMTJul 17 11:45
Edmund S. L. Lam and Iliano CervesatoReasoning About Set ComprehensionsSMTJul 17 12:15
Juergen Christ and Jochen HoenickeWeakly Equivalent ArraysSMTJul 17 14:30
Francesco Alberti, Silvio Ghilardi and Natasha SharyginaDecision Procedures for Flat Array PropertiesSMTJul 17 15:00
Richard Bonichon, David Déharbe and Cláudia TavaresExtending SMT-LIB v2 with Lambda-Terms and PolymorphismSMTJul 17 15:30
Guillaume MelquiondAutomating the Verification of Floating-Point AlgorithmsSMTJul 18 09:15
Tim King, Clark Barrett and Cesare TinelliLeveraging Linear and Mixed Integer Programming for SMTSMTJul 18 10:45
To Van Khanh, Vu Xuan Tung and Mizuhito OgawaraSAT: SMT for Polynomial InequalitySMTJul 18 11:15
Marek Kosta, Thomas Sturm and Andreas DolzmannBetter Answers to Real QuestionsSMTJul 18 11:45
Konstantin Korovin, Marek Kosta and Thomas SturmTowards Conflict-Driven Learning for Virtual SubstitutionSMTJul 18 12:15
Christos Dimoulas, Scott Moore, Aslan Askarov and Stephen ChongDeclarative Policies for Capability ControlCSFJul 19 10:45
Joshua Kroll, Gordon Stewart and Andrew AppelPortable Software Fault IsolationCSFJul 19 11:15
Radha Jagadeesan, Cm Lubinski, Corin Pitcher, James Riely and Charles WinebrinnerCertificates for Verifiable ForensicsCSFJul 19 11:45
Andrey Chudnov, George Kuan and David NaumannInformation flow monitoring as abstract interpretation for relational logicCSFJul 19 12:15
Pablo Buiras, Deian Stefan and Alejandro RussoOn Dynamic Flow-sensitive Floating-Label SystemsCSFJul 19 17:30
Heiko Mantel, Matthias Perner and Jens SauerNoninterference under Weak Memory ModelsCSFJul 19 18:00
Marian Harbach, Sascha Fahl and Matthew SmithWho’s Afraid of Which Bad Wolf? A Survey of IT Security Risk AwarenessCSFJul 20 10:45
Jens Grossklags and David ReitterHow Task Familiarity and Cognitive Predispositions Impact Behavior in a Security Game of TimingCSFJul 20 11:15
Jason Crampton and Alexandre PintoAttribute-based Encryption for Access Control Using Elementary OperationsCSFJul 20 14:30
Alex Malozemoff, Jonathan Katz and Matthew GreenAutomated Analysis and Synthesis of Block-Cipher Modes of OperationCSFJul 20 15:00
Joseph Ayo Akinyele, Gilles Barthe, Benjamin Grégoire, Benedikt Schmidt and Pierre-Yves StrubCertified Synthesis of Efficient Batch VerifiersCSFJul 20 15:30
Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya and Sarah MeiklejohnMalleable Signatures: New Definitions and Delegatable Anonymous CredentialsCSFJul 20 17:30
Chris Culnane and Steve SchneiderA Peered Bulletin Board for Robust Use in Verifiable Voting SystemsCSFJul 20 16:30
Dan Bogdanov, Peeter Laud, Sven Laur and Pille PullonenFrom Input Private to Universally Composable Secure Multi-party Computation PrimitivesCSFJul 20 17:00
Daniel Dougherty and Joshua GuttmanDecidability for Lightweight Diffie-Hellman ProtocolsCSFJul 21 10:45
Moses Liskov and Francisco Javier ThayerModeling Diffie-Hellman Derivability for Automated AnalysisCSFJul 21 11:15
David Basin, Cas Cremers and Marko HorvatActor Key Compromise: Consequences and CountermeasuresCSFJul 21 11:45
Sebastian A. Mödersheim and Georgios KatsorisA Sound Abstraction of the Parsing ProblemCSFJul 21 12:15
Willard Rafnsson and Andrei SabelfeldCompositional Information-flow Security for Interactive SystemsCSFJul 21 14:30
Mathy Vanhoef, Willem De Groef, Dominique Devriese, Frank Piessens and Tamara RezkStateful Declassification Policies for Event-Driven ProgramsCSFJul 21 15:00
Mario Alvim, Kostas Chatzikokolakis, Annabelle McIver, Carroll Morgan, Catuscia Palamidessi and Geoffrey SmithAdditive and multiplicative notions of leakage, and their capacitiesCSFJul 21 15:30
Benjamin Johnson, Aron Laszka and Jens GrossklagsThe Complexity of Estimating Systematic Risk in NetworksCSFJul 22 10:45
Roberto Vigo, Flemming Nielson and Hanne Riis NielsonAutomated Generation of Attack TreesCSFJul 22 11:15
Pedro Adão, Claudio Bozzato, Gian-Luca Dei Rossi, Riccardo Focardi and Flaminia LuccioMignis: A semantic based tool for firewall configurationCSFJul 22 11:45
Michele Bugliesi, Stefano Calzavara, Riccardo Focardi, Wilayat Khan and Mauro TempestaProvably Sound Browser-Based Enforcement of Web Session IntegrityCSFJul 22 12:15
Michael Backes, Praveen Manoharan and Esfandiar MohammadiTUC: Time-sensitive and Modular Analysis of Anonymous CommunicationCSFJul 22 16:30
Justin Hsu, Marco Gaboardi, Andreas Haeberlen, Sanjeev Khanna, Arjun Narayan, Benjamin Pierce and Aaron RothDifferential Privacy: An Economic Method for Choosing EpsilonCSFJul 22 17:00
Gilles Barthe, Marco Gaboardi, Emilio Jesús Gallego Arias, Justin Hsu, César Kunz and Pierre-Yves StrubProving differential privacy in Hoare logicCSFJul 22 17:30
Jia Liu, Mark Ryan and Liqun ChenBalancing Societal Security and Individual Privacy: Accountable Escrow SystemCSFJul 22 15:30
Guy Avni, Orna Kupferman and Tami TamirFrom Reachability to Temporal Specifications in Cost-Sharing GamesIJCAR
Veronique CortierElectronic voting: how logic can helpIJCAR
Rajeev GoreAnd-Or Tableaux for Fixpoint Logics with Converse: LTL, CTL, PDL and CPDLIJCARJul 19 10:45
Kenneth McMillanStructured Search and LearningIJCARJul 22 10:45
Jasmin Christian Blanchette, Andrei Popescu and Dmitriy TraytelUnified Classical Logic Completeness: A Coinductive PearlIJCARJul 19 11:45
Fredrik LindbladA Focused Sequent Calculus for Higher-Order LogicIJCARJul 19 12:15
Ori Lahav and Yoni ZoharSAT-based Decision Procedure for Analytic Pure Sequent CalculiIJCARJul 19 14:30
Marijn Heule, Martina Seidl and Armin BiereUnified Proof System for QBF PreprocessingIJCARJul 19 15:00
Carlos Ansótegui, Maria Luisa Bonet, Jesus Giráldez-Cru and Jordi LevyThe Fractal Dimension of SAT FormulasIJCARJul 19 15:30
Paula Chocron, Pascal Fontaine and Christophe RingeissenA Gentle Non-Disjoint Combination of Satisfiability ProceduresIJCARJul 19 16:30
Sophie Tourret, Mnacho Echenim and Nicolas PeltierA Rewriting Strategy to Generate Prime Implicates in Equational LogicIJCARJul 20 10:45
Peter Baumgartner, Joshua Bax and Uwe WaldmannFinite Quantification in Hierarchic Theorem ProvingIJCARJul 20 11:15
Josh Berdine and Nikolaj BjornerComputing All Implied Equalities via SMT-based Partition RefinementIJCARJul 20 11:45
Jürgen Giesl, Marc Brockschmidt, Fabian Emmes, Florian Frohn, Carsten Fuhs, Carsten Otto, Martin Plücker, Peter Schneider-Kamp, Thomas Stroeder, Steffi Swiderski and Rene ThiemannProving Termination of Programs Automatically with AProVEIJCARJul 20 12:15
Matthias Horbach and Viorica Sofronie-StokkermansLocality Transfer: From Constrained Axiomatizations to Reachability PredicatesIJCARJul 20 14:30
Thomas Stroeder, Jürgen Giesl, Marc Brockschmidt, Florian Frohn, Carsten Fuhs, Jera Hensel and Peter Schneider-KampProving Termination and Memory Safety for Programs with Pointer ArithmeticIJCARJul 20 15:00
Wenhui ZhangQBF Encoding of Temporal Properties and QBF-Based VerificationIJCARJul 20 15:30
Stefan Hetzl, Alexander Leitsch, Giselle Reis, Janos Tapolczai and Daniel WellerIntroducing quantified cuts in logic with equalityIJCARJul 20 16:30
Vivek Nigam, Giselle Reis and Leonardo LimaQuati: An Automated Tool for Proving Permutation LemmasIJCARJul 20 17:00
Rajeev Gore, Jimmy Thomson and Jesse Wu A History-Based Theorem Prover for Intuitionistic Propositional Logic using Global Caching: IntHistGC System DescriptionIJCARJul 20 17:20
Jens OttenMleanCoP: A Connection Prover for First-Order Modal LogicIJCARJul 20 17:40
Serenella Cerrito, Amélie David and Valentin GorankoOptimal tableaux-based decision procedure for testing satisfiability in the Alternating-time temporal logic ATL+IJCARJul 21 10:45
Jean-Baptiste Jeannin and André PlatzerdTL²: Differential Temporal Dynamic Logic with Nested Modalities for Hybrid SystemsIJCARJul 21 11:15
Bjoern Lellmann Axioms vs Hypersequent Rules with Context Restrictions: Theory and ApplicationsIJCARJul 21 11:45
Cláudia Nalon, João Marcos and Clare DixonClausal Resolution for Modal Logics of ConfluenceIJCARJul 21 12:15
Rajeev Gore, Kerry Olesen and Jimmy ThomsonImplementing Tableaux Calculi Using BDDs: BDDTab System DescriptionIJCARJul 21 12:45
Aleksandar Zeljić, Christoph M. Wintersteiger and Philipp RuemmerApproximations for Model ConstructionIJCARJul 21 14:30
Rüdiger Ehlers and Martin LangeA Tool that Incrementally Approximates Finite Satisfiability in Full Interval Temporal LogicIJCARJul 21 15:00
Aaron Stump, Geoff Sutcliffe and Cesare TinelliStarExec: a Cross-Community Infrastructure for Logic SolvingIJCARJul 21 15:20
Bruno Woltzenlogel Paleo, Joseph Boudou and Andreas FellnerSkeptik [System Description]IJCARJul 21 15:40
Fabio Papacchini and Renate A. SchmidtTerminating Minimal Model Generation Procedures for Propositional Modal LogicsIJCARJul 21 16:00
Daniel Gorin, Dirk Pattinson, Lutz Schröder, Thorsten Wißmann and Florian WidmannCOOL -- A Generic Satisfiability Checker For Coalgebraic Logics with Global Assumptions (System Description)IJCARJul 21 16:30
Olaf Beyersdorff and Leroy ChewThe Complexity of Theorem Proving in Circumscription and Minimal EntailmentIJCARJul 22 11:45
Laura Bozzelli and Cesar SanchezVisibly Linear Temporal LogicIJCARJul 22 12:15
Patrick Koopmann and Renate A. SchmidtCount and Forget: Uniform Interpolation of SHQ-OntologiesIJCARJul 22 14:30
Andreas Steigmiller, Birte Glimm and Thorsten LiebigCoupling Tableau Algorithms for Expressive Description Logics with Completion-based Saturation ProceduresIJCARJul 22 15:00
David Carral, Cristina Feier, Bernardo Cuenca Grau, Pascal Hitzler and Ian HorrocksEL-ifying OntologiesIJCARJul 22 15:30
İsmail İlkan Ceylan and Rafael PeñalozaThe Bayesian Description Logic BELIJCARJul 22 16:30
Michael Beeson and Larry WosOtter proofs in Tarskian geometryIJCARJul 22 17:00
Nicola Olivetti and Gian Luca PozzatoNESCOND: an Implementation of Nested Sequent Calculi for Conditional LogicsIJCARJul 22 17:30
Adam Pease and Stephan SchulzKnowledge Engineering for Large Ontologies with Sigma KEE 3.0IJCARJul 22 17:50
Georg GottlobStructural Decomposition Methods: How They MatterPCCRJul 18 14:30
Stefan SzeiderFixed-Parameter Algorithms for Reasoning Problems in NP and BeyondPCCRJul 17 11:00
Robert Ganian, Stefan Szeider and M.S. RamanujanDiscovering Archipelagos of Tractability: Split-Backdoors to Constraint SatisfactionPCCRJul 18 12:00
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider and Stanislav ZivnyBackdoors into Heterogeneous Classes of SAT and CSPPCCRJul 18 15:30
Jan JohannsenBackdoors into Two OccurrencesPCCRJul 18 11:15
Martin Kronegger, Martin Lackner, Andreas Pfandler and Reinhard PichlerA Parameterized Complexity Analysis of Generalized CP-NetsPCCRJul 17 12:00
Martin Kronegger, Sebastian Ordyniak and Andreas PfandlerBackdoors to PlanningPCCRJul 17 12:30
Nadia Labai and Johann MakowskyConnection matrices of finite rank instead of definability in Monadic Second Order LogicPCCRJul 18 10:45
R. Ramanujam and S P SureshIntuitionistic modal logics: efficient fragments and parameterized complexityPCCRJul 17 14:30
Martin Gebser and Jael KrienerThe ICLP 2014 Doctoral ConsortiumICLP
Matthias Baaz, Thomas Eiter and Helmut VeithVienna Summer of Logic PrefaceICLP
Michael Leuschel and Tom SchrijversIntroduction to the 30th International Conference on Logic Programming Special IssueICLP
Francesco Calimeri, Martin Gebser, Marco Maratea and Francesco RiccaThe Design of the Fifth Answer Set Programming CompetitionICLP
Andrey Rybalchenko(Quantified) Horn Constraint Solving for Program Verification and SynthesisICLPJul 17 14:30
Neng-Fa ZhouCombinatorial Search With PicatICLP
Mário Abrantes and Luís Moniz PereiraProperties of Stable Model Semantics ExtensionsICLPJul 21 11:00
Mario Alviano, Carmine Dodaro and Francesco RiccaAnytime Computation of Cautious Consequences in Answer Set ProgrammingICLPJul 22 17:00
Roberto Amadini, Maurizio Gabbrielli and Jacopo MauroSUNNY: a Lazy Portfolio Approach for Constraint SolvingICLPJul 22 11:30
Christian AnticOn Cascade Products of Answer Set ProgramsICLPJul 20 14:30
Miguel Areias and Ricardo RochaA Simple and Efficient Lock-Free Hash Trie Design for Concurrent TablingICLPJul 21 11:00
Rehan Abdul Aziz, Geoffrey Chu and Peter J. StuckeyGrounding Bound Founded Answer Set ProgramsICLPJul 21 12:15
Marcello Balduccini, William Regli and Duc NguyenAn ASP-Based Architecture for Autonomous UAVs in Dynamic EnvironmentsICLPJul 21 12:30
Roman Bartak and Neng-Fa ZhouUsing Tabled Logic Programming to Solve the Petrobras Planning ProblemICLPJul 22 12:00
Elena Bellodi, Evelina Lamma, Fabrizio Riguzzi, Vítor Santos Costa and Riccardo ZeseLifted Probabilistic Logic ProgrammingICLPJul 19 11:30
Yi Bi, Jia-Huai You and Zhiyong FengA Well-Founded Semantics for FOL-ProgramsICLPJul 21 11:15
Bart Bogaerts, Joachim Jansen, Bruynooghe Maurice, Broes De Cat, Joost Vennekens and Marc DeneckerSimulating Dynamic Systems Using Linear Time Calculus TheoriesICLPJul 20 17:00
Bart Bogaerts, Joost Vennekens, Marc Denecker and Jan Van den BusscheC-Log: A Knowledge Representation Language of CausalityICLPJul 21 11:45
Stefan BrassA Framework for Bottom-Up Simulation of SLD-ResolutionICLPJul 21 12:15
Pedro Cabalar, Jorge Fandiño and Michael FinkCausal Graph Justifications of Logic ProgramsICLPJul 20 15:30
Luciano Caroprese, Mirek Truszczynski, Ester Zumpano and Irina TrubitsynaA Measure of Arbitrariness in Abductive ExplanationsICLPJul 21 15:00
Sergio Castro, Kim Mens and Paulo MouraCustomisable Handling of Java References in Prolog ProgramsICLPJul 21 12:00
Angelos Charalambidis, Zoltan Esik and Panos RondogiannisMinimum Model Semantics for Extensional Higher-order Logic Programming with NegationICLPJul 19 12:00
Marco Comini, Laura Titolo and Alicia VillanuevaAbstract Diagnosis for tccp using a Linear Temporal LogicICLPJul 19 12:30
Flavio Cruz, Seth Goldstein, Frank Pfenning and Ricardo RochaA Linear Logic Programming Language for Concurrent Programming over Graph StructuresICLPJul 19 11:00
Gregory J. Duck, Rémy Haemmerlé and Martin SulzmannOn Termination, Confluence and Consistent CHR-based Type InferenceICLPJul 20 11:30
Daniel Gall and Thom FrühwirthExchanging Conflict Resolution in an Adaptable Implementation of ACT-RICLPJul 20 12:00
John P. Gallagher and Bishoksan KafleAnalysis and Transformation Tools for Constrained Horn Clause VerificationICLPJul 21 11:30
Marco Gavanelli, Michela Milano, Stefano Bragaglia, Federico Chesani, Elisa Marengo and Paolo CagnoliMulti-criteria optimal planning for Energy policies in CLPICLPJul 21 10:45
Martin Gebser, Roland Kaminski, Benjamin Kaufmann and Torsten SchaubClingo = ASP + ControlICLPJul 21 11:15
Michael Gelfond and Yuanlin ZhangVicious Circle Principle and Logic Programs with AggregatesICLPJul 20 15:00
Ana Sofia Gomes and Jose Julio AlferesTransaction Logic with (Complex) EventsICLPJul 21 10:45
Jónathan Heras, Ekaterina Komendantskaya and Martin Schmidt(Co)recursion in Logic Programming: Lazy vs EagerICLPJul 21 11:45
Holger Hoos, Marius Lindauer and Torsten Schaubclaspfolio 2: Advances in Algorithm Selection for Answer Set ProgrammingICLPJul 20 17:30
Ethan K. JacksonA Module System for Domain-Specific LanguagesICLPJul 19 14:30
Torbjörn Lager and Jan WielemakerPengines: Web Logic Programming Made EasyICLPJul 19 16:30
Tiep Le, Enrico Pontelli, Tran Cao Son and William YeohLogic and Constraint Logic Programming for Distributed Constraint OptimizationICLPJul 21 11:30
Theofrastos Mantadelis, Ricardo Rocha and Paulo MouraTabling, Rational Terms, and Coinduction Finally Together!ICLPJul 19 17:30
Kyle Marple and Gopal GuptaDynamic Consistency Checking in Goal-Directed Answer Set ProgrammingICLPJul 22 16:30
Luís Moniz Pereira, Emmanuelle-Anna Dietz and Steffen HölldoblerContextual Abductive Reasoning with Side-EffectsICLPJul 21 15:30
Arun Nampally and C. R. RamakrishnanAdaptive MCMC-Based Inference in Probabilistic Logic ProgramsICLPJul 21 12:00
G. NarboniNumerical Properties of Min-closed CSPsICLPJul 21 11:00
Vivek Nigam, Carlos Olarte and Elaine PimentelA Proof Theoretic Study of Soft Concurrent Constraint ProgrammingICLPJul 22 12:30
Aya Saad, Thom Fruehwirth and Carmen GervetThe P-Box CDF-Intervals: A Reliable Constraint Reasoning with Quantifiable InformationICLPJul 20 12:30
Ari Saptawijaya and Luís Moniz PereiraJoint Tabling of Logic Program Abductions and UpdatesICLPJul 21 10:45
Alejandro Serrano, Pedro Lopez-Garcia and Manuel V. HermenegildoResource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized TypesICLPJul 22 15:30
Martin Slota, Martin Balaz and Joao LeiteOn Strong and Default Negation in Answer-Set Program UpdatesICLPJul 21 11:30
George Souza Oliveira and Anderson Faustino Da SilvaTowards an Efficient Prolog System by Code IntrospectionICLPJul 21 11:45
Nataliia Stulova, Jose F. Morales and Manuel V. HermenegildoTowards Assertion-based Debugging of Higher-Order (C)LP ProgramsICLPJul 21 11:15
Terrance SwiftIncremental Tabling for Knowledge Representation and ReasoningICLPJul 19 17:00
Ilias Tachmazidis, Grigoris Antoniou and Wolfgang FaberEfficient Computation of the Well-Founded Semantics over Big DataICLPJul 22 17:30
Paul Tarau and Fahmida HamidInterclausal Logic VariablesICLPJul 21 12:15
Zhizheng ZhangESmodels: An Epistemic Specification SolverICLPJul 21 12:00
Rehan Abdul AzizBound Founded Answer Set ProgrammingICLP
Joachim JansenModel Revision Inference for Extensions of First Order LogicICLP
Grzegorz JaśkiewiczLogic Programming as Scripting Language for Bots in Computer Games - Research OverviewICLP
Michael MorakThe Impact of Disjunction on Reasoning under Existential Rules: Research SummaryICLP
Aya SaadCDF-Intervals: A Reliable Framework to Reason about Data with UncertaintyICLP
Nada SharafVisualization of Constraint Handling RulesICLP
Heike StephanApplication of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic ProgramsICLP
Riccardo ZeseReasoning with Probabilistic LogicsICLP
Christel Baier, Clemens Dubslaff and Sascha KlueppelholzTrade-Off Analysis Meets Probabilistic Model CheckingCSL-LICSJul 18 09:15
Patrick Cousot and Radhia CousotAbstract Interpretation: Past, Present and FutureCSL-LICSJul 15 16:30
Jasmin FisherUnderstanding Biology through LogicCSL-LICSJul 14 14:30
Assia MahboubiComputer-checked mathematics: a formal proof of the Odd Order theoremCSL-LICSJul 14 10:45
Anuj DawarThe Ackermann Award 2014CSL-LICSJul 18 17:00
Dexter KozenCitations for the Test-of-Time Award from 1994CSL-LICSJul 18 16:30
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar and Patrick TotzkeInfinite-State Energy GamesCSL-LICSJul 16 11:45
Beniamino Accattoli and Ugo Dal LagoBeta Reduction is Invariant, IndeedCSL-LICSJul 14 17:00
Rajeev Alur, Adam Freilich and Mukund RaghothamanRegular Combinators for String TransformationsCSL-LICSJul 18 14:30
Eugene Asarin, Michel Bockelet, Aldric Degorre, Cătălin Dima and Chunyan MuAsymptotic behaviour in temporal logicCSL-LICSJul 18 11:45
Christel Baier, Joachim Klein, Sascha Klueppelholz and Sascha WunderlichWeight Monitoring with Linear Temporal Logic: Complexity and DecidabilityCSL-LICSJul 18 12:15
Pablo Barceló and Pablo MuñozGraph Logics with Rational Relations: The Role of Word CombinatoricsCSL-LICSJul 16 10:45
Michael Benedikt, Balder Ten Cate and Michael Vanden BoomEffective Interpolation and Preservation in Guarded LogicsCSL-LICSJul 16 16:30
Marco Bernardo, Davide Sangiorgi and Valeria VignudelliOn the Discriminating Power of Passivation and Higher-Order InteractionCSL-LICSJul 18 11:15
Paul Bilokon and Abbas EdalatA domain-theoretic approach to Brownian motion and general continuous stochastic processesCSL-LICSJul 14 11:45
Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Paweł Parys and Michael Vanden BoomTwo-Way Cost Automata and Cost Logics over Infinite TreesCSL-LICSJul 15 14:30
Christoph Dittmann, Stephan Kreutzer and Mikolaj BojanczykDecomposition Theorems and Model-Checking for the Modal $\mu$-calculusCSL-LICSJul 15 14:30
Benedikt BolligLogic for Communicating Automata with Parameterized TopologyCSL-LICSJul 14 16:30
Benedikt Bollig, Paul Gastin, Benjamin Monmege and Marc ZeitounLogical Characterization of Weighted Pebble Walking AutomataCSL-LICSJul 15 15:00
Filippo Bonchi, Daniela Petrisan, Damien Pous and Jurriaan RotCoinduction Up-To in a Fibrational SettingCSL-LICSJul 15 10:45
Simone Bova, Robert Ganian and Stefan SzeiderModel Checking Existential Logic on Partially Ordered SetsCSL-LICSJul 16 11:15
Tomas Brazdil, Stefan Kiefer, Antonin Kucera, Petr Novotný and Joost-Pieter KatoenZero-Reachability in Probabilistic Multi-Counter AutomataCSL-LICSJul 15 10:45
Romain Brenguier, Jean-Francois Raskin and Mathieu SassolasThe Complexity of Admissibility in Omega-Regular GamesCSL-LICSJul 17 15:00
Flavien BreuvartOn the characterization of models of H*CSL-LICSJul 17 15:00
James Brotherston, Carsten Fuhs, Nikos Gorogiannis and Juan Navarro PerezA Decision Procedure for Satisfiability in Separation Logic with Inductive PredicatesCSL-LICSJul 16 17:30
Véronique Bruyère, Noémie Meunier and Jean-Francois RaskinSecure Equilibria in Weighted GamesCSL-LICSJul 15 11:45
Facundo Carreiro, Alessandro Facchini, Yde Venema and Fabio ZanasiWeak MSO: Automata and Expressiveness Modulo BisimilarityCSL-LICSJul 16 12:15
Simon Castellan, Pierre Clairambault and Glynn WinskelSymmetry in Concurrent GamesCSL-LICSJul 14 18:00
Witold Charatonik, Emanuel Kieronski and Filip MazowieckiDecidability of Weak Logics with Deterministic Transitive ClosureCSL-LICSJul 17 14:30
Kaustuv Chaudhuri and Nicolas GuenotEquality and Fixpoints in the Calculus of StructuresCSL-LICSJul 16 17:30
Hubie ChenThe Tractability Frontier of Graph-Like First-Order Query SetsCSL-LICSJul 16 15:30
Hubie Chen and Moritz MuellerOne Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive QueriesCSL-LICSJul 16 15:00
Taolue Chen and Stefan KieferOn the Total Variation Distance of Labelled Markov ChainsCSL-LICSJul 14 11:15
Julien Cretin and Didier RémySystem F with Coercion ConstraintsCSL-LICSJul 16 14:30
Ugo Dal Lago, Claudia Faggian, Ichiro Hasuo and Akira YoshimizuThe Geometry of SynchronizationCSL-LICSJul 18 11:15
Anupam DasOn the Pigeonhole and Related Principles in Deep Inference and Monotone SystemsCSL-LICSJul 14 17:30
Stephane Demri and Morgan DetersExpressive Completeness of Separation Logic With Two Variables and No Separating ConjunctionCSL-LICSJul 16 17:00
Thomas EhrhardA new correctness criterion for MLL proof netsCSL-LICSJul 18 11:45
Joerg Endrullis and Dimitri HendriksOn Periodically Iterated MorphismsCSL-LICSJul 18 15:00
Diego Figueira and Leonid LibkinPattern Logics and Auxiliary RelationsCSL-LICSJul 17 15:30
Marcelo Fiore and Sam StatonSubstitution, jumps, and algebraic effectsCSL-LICSJul 16 16:30
Matt Fredrikson and Somesh JhaSatisfiability Modulo Counting: A New Approach for Analyzing Privacy PropertiesCSL-LICSJul 16 12:15
Georg Gottlob and Enrico MaliziaAchieving New Upper Bounds for the Hypergraph Duality Problem through Logic CSL-LICSJul 15 15:30
Niels Bjørn Bugge Grathwohl, Dexter Kozen and Konstantinos MamourasKAT + B!CSL-LICSJul 17 14:30
Nicolas Guenot and Lutz StrassburgerSymmetric Normalisation for Intuitionistic LogicCSL-LICSJul 16 11:45
Julian Gutierrez and Michael WooldridgeEquilibria of Concurrent Games on Event StructuresCSL-LICSJul 14 17:00
Christoph HaaseSubclasses of Presburger Arithmetic and the Weak EXP HierarchyCSL-LICSJul 18 10:45
Matthew HagueSenescent Ground Tree Rewrite SystemsCSL-LICSJul 15 11:15
Frederik Harwath, Lucas Heimberg and Nicole SchweikardtPreservation and decomposition theorems for bounded degree structuresCSL-LICSJul 17 11:15
Willem Heijltjes and Robin HoustonNo proof nets for MLL with units: Proof equivalence in MLL is PSPACE-completeCSL-LICSJul 16 17:00
Wei Chen and Martin HofmannAbstract Interpretation from Buchi AutomataCSL-LICSJul 15 11:45
Naohiko Hoshino, Koko Muroya and Ichiro HasuoMemoryful Geometry of Interaction: From Coalgebraic Components to Algebraic EffectsCSL-LICSJul 17 11:15
Danko IlikAxioms and Decidability for Type Isomorphism in the Presence of SumsCSL-LICSJul 16 10:45
Alan JeffreyFunctional Reactive TypesCSL-LICSJul 17 15:30
Joost-Pieter Katoen, Lei Song and Lijun ZhangProbably Safe or LiveCSL-LICSJul 16 15:30
Bakh KhoussainovA quest for algorithmically random infinite structuresCSL-LICSJul 14 10:45
Stanislav Kikot, Roman Kontchakov, Vladimir Podolskii and Michael ZakharyaschevOn the Succinctness of Query Rewriting over Shallow OntologiesCSL-LICSJul 17 11:45
Bartek Klin, Sławomir Lasota, Joanna Ochremiak and Szymon ToruńczykTuring Machines with Atoms, Constraint Satisfaction Problems, and Descriptive ComplexityCSL-LICSJul 14 16:30
Eric Koskinen and Tachio TerauchiLocal Temporal ReasoningCSL-LICSJul 15 15:30
Stephan Kreutzer and Nicole SchweikardtOn Hanf-equivalence and the number of embeddings of small induced subgraphsCSL-LICSJul 16 14:30
Ranko Lazić and Sylvain SchmitzNon-Elementary Complexities for Branching VASS, MELL, and ExtensionsCSL-LICSJul 18 12:15
Stephane Le Roux and Arno PaulyInfinite sequential games with real-valued payoffsCSL-LICSJul 15 12:15
Jerome Leroux, M. Praveen and Grégoire SutreHyper-Ackermannian Bounds for Pushdown Vector Addition SystemsCSL-LICSJul 17 10:45
Paul Blain Levy and Sam StatonTransition systems over gamesCSL-LICSJul 17 10:45
Hongjin Liang, Xinyu Feng and Zhong ShaoCompositional Verification of Termination-Preserving Refinement of Concurrent ProgramsCSL-LICSJul 14 17:30
Daniel R. Licata and Eric FinsterEilenberg-MacLane Spaces in Homotopy Type TheoryCSL-LICSJul 18 15:30
Katja Losemann and Wim MartensMSO Queries on Trees: Enumerating Answers under UpdatesCSL-LICSJul 17 12:15
Marcello MaminoOn the Computing Power of +, −, and ×CSL-LICSJul 14 12:15
Konstantinos MamourasOn the Hoare Theory of Monadic Recursion SchemesCSL-LICSJul 17 12:15
Guillaume Munch-MaccagnoniFormulae-as-Types for an Involutive NegationCSL-LICSJul 18 15:00
Rasmus Ejlers MøgelbergA type theory for productive coprogramming via guarded recursionCSL-LICSJul 18 14:30
Luca PadovaniDeadlock and lock freedom in the linear pi-calculusCSL-LICSJul 15 11:15
Matthieu PerrinelOn Context Semantics for Interaction NetsCSL-LICSJul 18 10:45
Grgur Petric Maretic, Mohammad Torabi Dashti and David BasinAnchored LTL SeparationCSL-LICSJul 16 15:00
Thomas Place and Marc ZeitounSeparating Regular Languages with First-Order LogicCSL-LICSJul 15 12:15
Ian Pratt-HartmannLogics with Counting and EquivalenceCSL-LICSJul 15 15:00
Pierre-Marie PédrotA functional functional interpretationCSL-LICSJul 16 11:15
Takeshi Tsukada and Luke OngCompositional Higher-Order Model Checking via Omega-Regular Games over Boehm TreesCSL-LICSJul 17 11:45
Yaron VelnerFinite-Memory Strategy Synthesis for Robust Multidimensional Mean-Payoff ObjectivesCSL-LICSJul 18 15:30
Ryan WilliamsFaster decision of first-order graph propertiesCSL-LICSJul 14 18:00
Jean-Michel MullerGetting tight error bounds in floating-point arithmetic: illustration with complex functions, and the real x^n functionNSVJul 17 09:15
Sumit Kumar JhaVerifying Parameterized Software Models in Computational IData Science against Behavioral SpecificationsNSVJul 17 16:30
James KapinskiNumerical Challenges in Simulation-guided Dynamical System AnalysisNSVJul 18 16:30
Pierre Neron Certifying Square Root and Division EliminationNSVJul 17 14:30
Alexandre Chapoutot, Nasrine Damouche and Matthieu MartelTransformation of a PID Controller for Numerical AccuracyNSVJul 17 11:15
Christoph SpandlComputational complexity of iterated maps on points and setsNSVJul 17 15:00
Geoffrey C. Hulette, Robert C. Armstrong, Jackson R. Mayo and Joseph R. RuthruffTheorem-Proving Analysis of Digital Control Logic Interacting with Continuous DynamicsNSVJul 17 10:45
Assale AdjePolicy iteration in finite templates domainNSVJul 17 11:45
Takahito Aoto and Sorin StratulatDecision Procedures for Proving Inductive Theorems Without InductionIFIP-WG16Jul 13 08:45
Gilles Dowek and Ying JiangRewriting, Proofs, and Transition SystemsIFIP-WG16Jul 13 10:45
Maria Paola Bonacina and David PlaistedSemantically-Guided Goal-Sensitive Theorem ProvingIFIP-WG16Jul 13 11:30
Nao Hirokawa, Aart Middeldorp and Georg MoserBasic NormalizationIFIP-WG16Jul 13 14:30
Florent Jacquemard, Jean Bresson and Pierre Donat-BouilludRhythm Tree RewritingIFIP-WG16Jul 13 15:15
Michael LeuschelTowards Constraint-Solving over Higher-Order Unbounded Datatypes using Formal Methods ToolsVPT
Klaus von Gleissenthall, Andrey Rybalchenko and Santiago Zanella-BéguelinTowards Automated Proving of Relational Properties of Probabilistic Programs (Invited Talk)VPTJul 18 08:45
Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi and Maurizio ProiettiProgram Verification using Constraint Handling Rules and Array Constraint GeneralizationsVPTJul 17 11:30
Daniil Frumin and Irina LomazovaBranching Processes of Conservative Nested Petri NetsVPTJul 18 11:30
Geoff Hamilton and Morten Heine SørensenLocal Driving in Higher-Order Positive Supercompilation via the Omega-theoremVPTJul 18 12:15
Alexei Lisitsa and Andrei NemytykhA Note on Program Specialization. What Syntactical Properties of Residual Programs Can Reveal?VPTJul 17 12:15
Andrei NemytykhOn Unfolding for Programs Using Strings as a Data TypeVPTJul 18 10:45
Antonina NepeivodaVerification of Multi-Party Ping-Pong Protocols via Program TransformationVPTJul 17 10:45
Thomas SewellFormal Replay of Translation Validation for Highly Optimised CVPTJul 18 17:30
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger and Stefan WoltranComputing Secure Sets in Graphs using Answer Set ProgrammingASPOCPJul 23 15:35
Mario Alviano, Carmine Dodaro, Joao Marques-Silva and Francesco RiccaOn the Implementation of Weak Constraints in WASPASPOCPJul 23 16:55
Joseph Babb and Joohyung LeeAction Language BC+: Preliminary ReportASPOCPJul 23 12:35
Evgenii Balai and Patrick KahlEpistemic Logic Programs with SortsASPOCPJul 23 11:10
Gerhard Brewka, James Delgrande, Javier Romero and Torsten Schaub``Are Preferences Giving You a Headache?'' - ``Take asprin!''ASPOCPJul 23 16:30
Pedro Cabalar and Martín DiéguezTemporal Stable Models are LTL-representableASPOCPJul 23 11:45
Stefania Costantini and Andrea FormisanoQuery Answering in Resource-Based Answer Set SemanticsASPOCPJul 23 14:45
Martin Gebser, Tomi Janhunen and Jussi RintanenDeclarative Encodings of Acyclicity PropertiesASPOCPJul 23 15:10
Amelia Harrison, Vladimir Lifschitz, David Pearce and Agustín ValverdeInfinitary Equilibrium LogicASPOCPJul 23 09:50
Patrick Kahl, Richard Watson, Michael Gelfond and Yuanlin ZhangA Refinement of the Language of Epistemic SpecificationsASPOCPJul 23 10:45
Kostyantyn ShchekotykhinInteractive Query-based Debugging of ASP ProgramsASPOCPJul 23 17:20
Ilias Tachmazidis, Grigoris Antoniou and Wolfgang FaberComputing Answer Sets for Monadic Logic Programs via MapReduceASPOCPJul 23 17:45
Shahab Tasharrofi and Eugenia TernovskaSupported Semantics for Modular SystemsASPOCPJul 23 09:25
Shiqi Zhang, Fangkai Yang, Piyush Khandelwal and Peter StoneMobile Robot Planning using Action Language BC with Hierarchical Domain AbstractionsASPOCPJul 23 12:10
Gilles Audemard, Benoît Hoessen, Saïd Jabbour and Cédric PietteDolius: A Distributed Parallel SAT Solving FrameworkPOSJul 13 09:15
Marijn Heule, Norbert Manthey and Tobias PhilippValidating Unsatisfiability Results of Clause Sharing Parallel SAT SolversPOSJul 13 09:45
Laurent SimonPost Mortem Analysis of SAT Solver ProofsPOSJul 13 10:45
Zoltan Mann and Pal PappFormula partitioning revisitedPOSJul 13 11:15
Norbert Manthey and Enrique AlfonsoNew CNF Features and Formula ClassificationPOSJul 13 11:45
Zoltan MannTypical-case complexity and the SAT competitionsPOSJul 13 12:15
Armin BiereLingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver LingelingPOSJul 13 14:30
Norbert Manthey, Peter Steinke, Steffen Hölldobler and Tobias PhilippGeneric CDCL -- A Formalization of Modern Propositional Satisfiability SolversPOSJul 13 15:30
David MonniauxHow do we get Inductive Invariants?CAVJul 18 08:45
Fabio SomenziHardware Model CheckingCAVJul 18 14:30
Erik WinfreeDesigning and Verifying Molecular Circuits and Systems Made of DNACAVJul 19 17:10
Rance CleavelandAutomated TestingCAVJul 20 17:10
Rajeev Alur, Dana Fisman, Rishab Singh and Armando Solar-LezamaThe First Syntax-Guided Synthesis Competition (SyGuS-COMP 2014)CAVJul 19 12:55
Armin Biere and Keijo HeljankoHardware Model Checking Competition CAV 2014 EditionCAVJul 20 14:30
Roderick Bloem, Rüdiger Ehlers and Swen JacobsSYNTCOMP - Synthesis Competition for Reactive SystemsCAVJul 21 12:55
Jean-Christophe Filliatre, Léon Gondelman and Andrei PaskevichThe Spirit of Ghost CodeCAVJul 19 10:45
Anvesh Komuravelli, Arie Gurfinkel and Sagar ChakiSMT-based Model Checking for Recursive ProgramsCAVJul 19 11:05
Shachar Itzhaky, Nikolaj Bjorner, Thomas Reps, Mooly Sagiv and Aditya ThakurProperty-Directed Shape AnalysisCAVJul 19 11:25
Quang Loc Le, Cristian Gherghina, Shengchao Qin and Wei-Ngan ChinShape Analysis via Second-Order Bi-AbductionCAVJul 19 11:45
Pranav Garg, Christof Loding, P. Madhusudan and Daniel NeiderICE: A Robust Learning Framework for Synthesizing InvariantsCAVJul 19 12:05
Rahul Sharma and Alex AikenFrom Invariant Checking to Invariant Inference Using Randomized SearchCAVJul 19 12:25
Zvonimir Rakamaric and Michael EmmiSMACK: Decoupling Source Language Details from Verifier ImplementationsCAVJul 19 12:45
Hassan Eldib and Chao WangSynthesis of Masking Countermeasures against Side Channel AttacksCAVJul 19 14:30
Omar Chowdhury, Limin Jia, Deepak Garg and Anupam DattaTemporal Mode-Checking for Runtime Monitoring of Privacy PoliciesCAVJul 19 14:50
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Lukas Holik, Ahmed Rezine, Philipp Reummer and Jari StenmanString Constraints for VerificationCAVJul 19 15:10
Sudeep Kanav, Peter Lammich and Andrei PopescuA Conference Management System with Verified Document ConfidentialityCAVJul 19 15:30
Anna Lisa Ferrara, P. Madhusudan, Truc L. Nguyen and Gennaro ParlatoVAC - Verifier of Administrative Role-based Access Control PoliciesCAVJul 19 15:50
Javier Esparza and Jan KretinskyFrom LTL to Deterministic Automata: A Safraless Compositional ApproachCAVJul 19 16:30
Loris D'Antoni and Rajeev AlurSymbolic Visibly Pushdown AutomataCAVJul 19 16:50
Ethel Bardsley, Adam Betts, Nathan Chong, Peter Collingbourne, Pantazis Deligiannis, Alastair Donaldson, Jeroen Ketema, Dan Liew and Shaz QadeerEngineering a Static Verification Tool for GPU KernelsCAVJul 20 10:45
Kenneth McMillanLazy Annotation RevisitedCAVJul 20 11:05
Yakir Vizel and Arie GurfinkelInterpolating Property Directed ReachabilityCAVJul 20 11:25
Jesse Bingham and Joe Leslie-HurdVerifying Relative Error Bounds using Symbolic SimulationCAVJul 20 11:45
Milos Gligoric, Rupak Majumdar, Rohan Sharma, Lamyaa Eloussi and Darko MarinovRegression Test Selection for Distributed Software HistoriesCAVJul 20 12:05
Anton Wijs, Joost-Pieter Katoen and Dragan BosnackiGPU-Based Graph Decomposition into Strongly Connected and Maximal End ComponentsCAVJul 20 12:25
Dirk Beyer, Georg Dresler and Philipp WendlerSoftware Verification in the Google App-Engine CloudCAVJul 20 12:45
Roberto Cavada, Alessandro Cimatti, Michele Dorigatti, Alberto Griggio, Alessandro Mariotti, Andrea Micheli, Sergio Mover, Marco Roveri and Stefano TonettaThe nuXmv Symbolic Model CheckerCAVJul 20 12:55
Hillel Kugler, Nicola Paoletti, Boyan Yordanov, Youssef Hamadi and Christoph M. WintersteigerAnalyzing and Synthesizing Genomic Logic FunctionsCAVJul 20 14:40
Byron Cook, Jasmin Fisher, Benjamin Hall, Samin Ishtiaq, Garvit Juniwal and Nir PitermanFinding instability in biological modelsCAVJul 20 15:00
Zhenqi Huang, Chuchu Fan, Alexandru Mereacre, Sayan Mitra and Marta KwiatkowskaInvariant verification of nonlinear hybrid automata networks of cardiac cellsCAVJul 20 15:20
Henri Hansen, Shang-Wei Lin, Yang Liu, Truong Khanh Nguyen and Jun SunDiamonds are a Girl's Best Friend: Partial Order Reduction for Timed Automata With AbstractionsCAVJul 20 15:40
Willem HagemannReachability Analysis of Hybrid Systems Using Symbolic Orthogonal ProjectionsCAVJul 20 16:30
Alessandro Cimatti, Alberto Griggio, Sergio Mover and Stefano TonettaVerifying LTL properties of hybrid systems with K-livenessCAVJul 20 16:50
Rodica Bozianu, Catalin Dima and Emmanuel FiliotSafraless Synthesis for Epistemic Temporal SpecificationsCAVJul 21 10:45
Tomas Brazdil, David Klaska, Antonin Kucera and Petr NovotnýMinimizing Running Costs in Consumption SystemsCAVJul 21 11:05
Krishnendu Chatterjee, Martin Chmelík and Przemyslaw DacaCEGAR for Qualitative Analysis of Probabilistic SystemsCAVJul 21 11:25
Thomas Dillig, Isil Dillig and Swarat ChaudhuriOptimal Guard Synthesis for Memory SafetyCAVJul 21 11:45
Jade Alglave, Daniel Kroening, Vincent Nimal and Daniel PoetzlDon't sit on the fence: A static analysis approach to automatic fence insertionCAVJul 21 12:05
Petr Čermák, Alessio Lomuscio, Fabio Mogavero and Aniello MuranoMCMAS-SLK: A Model Checker for the Verification of Strategy Logic SpecificationsCAVJul 21 12:25
Nina Narodytska, Alexander Legg, Fahiem Bacchus, Leonid Ryzhyk and Adam WalkerSolving Games without Controllable PredecessorCAVJul 21 12:35
Chih-Hong Cheng, Chung-Hao Huang, Harald Ruess and Stefan StattelmannG4LTL-ST: Automatic Generation of PLC ProgramsCAVJul 21 12:45
Mohsen Lesani, Todd Millstein and Jens PalsbergAutomatic Atomicity Verification for Clients of Concurrent Data StructuresCAVJul 21 14:30
Pavol Cerny, Thomas Henzinger, Arjun Radhakrishna, Leonid Ryzhyk and Thorsten TarrachRegression-free Synthesis for ConcurrencyCAVJul 21 14:50
Omar Inverso, Ermenegildo Tomasco, Bernd Fischer, Salvatore La Torre and Gennaro ParlatoBounded Model Checking of Multi-Threaded C Programs via Lazy SequentializationCAVJul 21 15:10
Javier Esparza, Ruslán Ledesma-Garza, Rupak Majumdar, Philipp Meyer and Filip NiksicAn SMT-based Approach to Coverability AnalysisCAVJul 21 15:30
Alejandro Sanchez and Cesar SanchezLEAP: A Tool for the Parametrized Verification of Concurrent DatatypesCAVJul 21 15:50
Margus Veanes, Nikolaj Bjorner, Lev Nachmanson and Sergey BeregMonadic DecompositionCAVJul 22 10:45
Tianyi Liang, Andrew Reynolds, Cesare Tinelli, Clark Barrett and Morgan DetersA DPLL(T) Theory Solver for a Theory of Strings and Regular ExpressionsCAVJul 22 11:05
Alexander NadelBit-Vector Rewriting with Automatic Rule GenerationCAVJul 22 11:25
Liana Hadarean, Clark Barrett, Dejan Jovanović, Cesare Tinelli and Kshitij BansalA Tale of Two Solver: Eager and Lazy Approaches to Bit-vectorsCAVJul 22 11:45
Andrei VoronkovAVATAR: The New Architecture for First-Order Theorem ProversCAVJul 22 12:05
Ruzica Piskac, Thomas Wies and Damien ZuffereyAutomating Separation Logic with Trees and DataCAVJul 22 12:25
Ashish Tiwari and Patrick LincolnA Nonlinear Real Arithmetic FragmentCAVJul 22 12:45
Bruno DutertreYices 2.2CAVJul 22 12:55
Moritz Sinn, Florian Zuleger and Helmut VeithA Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity AnalysisCAVJul 22 14:30
Ravichandhran Madhavan and Viktor KuncakSymbolic Resource Bound Inference for Functional ProgramsCAVJul 22 14:50
Daniel Larraz, Kaustubh Nimkar, Albert Oliveras, Enric Rodríguez-Carbonell and Albert RubioProving Non-termination Using Max-SMTCAVJul 22 15:10
Matthias Heizmann, Jochen Hoenicke and Andreas PodelskiTermination Analysis by Learning Terminating ProgramsCAVJul 22 15:30
Andrey Kupriyanov and Bernd FinkbeinerCausal Termination of Multi-threaded ProgramsCAVJul 22 15:50
Johannes Birgmeier, Aaron R. Bradley and Georg WeissenbacherCounterexample to Induction-Guided Abstraction-Refinement (CTIGAR)CAVJul 22 16:40
Suho Lee and Karem A. SakallahUnbounded Scalable Verification Based on Approximate Property-Directed Reachability and Datapath AbstractionCAVJul 22 17:00
Arlen Cox, Bor-Yuh Evan Chang and Sriram SankaranarayananQUICr: A Reusable Library for Parametric Abstraction of Sets and NumbersCAVJul 22 17:20
Disclaimer | Powered by EasyChair Smart Program