[Hol-info] Proving a negative statement
I want to prove ``a <> b`` for some a,b. After stripping I am asked to prove F. I was able to use the assumptions to prove ``F = T``. At this point I thought "asm_simp_tac bool_ss []" should finish the proof but it doesn't. So "pop_assum (fn th => rewrite_tac [th]" actually finished the work for me. Is this to be expected? Thanks, Haitao ___ hol-info mailing list hol-info@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/hol-info
[Hol-info] LSFA 2019 - Second Call for papers
SECOND CALL FOR PAPERS LSFA 2019 14th Workshop on Logical and Semantic Frameworks, with Applications 24-26 August 2019, Natal, Brazil https://sites.google.com/view/lsfa2019 Logical and semantic frameworks are formal languages used to represent logics, languages and systems. These frameworks provide foundations for the formal specification of systems and programming languages, supporting tool development and reasoning. LSFA 2019 will be a satellite event of CADE-27, which will be held in Natal, Brazil, 25-30 August, 2019 (https://www.mat.ufrn.br/cade-27/). Previous editions of LSFA took place in Fortaleza (2018), Brasília (2017, collocated with Tableaux+FroCoS+ITP), Porto (2016), Natal (2015), Brasília (2014), São Paulo (2013), Rio de Janeiro (2012), Belo Horizonte (2011), Natal (2010), Brasília (2009), Salvador (2008), Ouro Preto (2007), and Natal (2006). See http://lsfa.cic.unb.br for more information. TOPICS OF INTEREST Topics of interest include, but are not limited to: * Specification languages and meta-languages * Formal semantics of languages and logical systems * Logical frameworks * Semantic frameworks * Type theory * Proof theory * Automated deduction * Implementation of logical or semantic frameworks * Applications of logical or semantic frameworks * Computational and logical properties of semantic frameworks * Logical aspects of computational complexity * Lambda and combinatory calculi * Process calculi SUBMISSION AND PUBLICATION Contributions should be written in English and submitted in the form of full papers with a maximum of 13 pages including references. Beyond full regular papers, we encourage submissions such as proof pearls, rough diamonds (preliminary results and work in progress), original surveys, or overviews of research projects, where the focus is more on elegance and dissemination than on novelty. Papers belonging to this second category are expected to be short, that is, of a maximum of 6 pages including references. For both paper categories, additional technical material can be provided in a clearly marked appendix which will be read by reviewers at their discretion. Contributions must also be unpublished and not submitted simultaneously for publication elsewhere. The papers should be prepared in LaTeX using the generic ENTCS package (http://www.entcs.org/prelim.html). The submission should be in the form of a PDF file uploaded to Easychair: https://easychair.org/conferences/?conf=lsfa2019 At least one of the authors should register for the workshop. All accepted papers will be available online during the workshop; full papers will be published at ENTCS, and short papers will be collected in an informal volume. For the publication of the proceedings there will be a cost to authors of USD 50 at registration time. Previous LSFA special issues have been published in journals such as Log J IGPL and TCS (see http://lsfa.cic.unb.br). IMPORTANT DATES: * Submission deadline: April 19 * Notification to authors: May 24 * Proceedings version due: June 21 * LSFA 2019: August 24-26 INVITED SPEAKERS * Pascal Fontaine, LORIA * Achim Jung, University of Birmingham * Vivek Nigam, Fortiss * Elaine Pimentel, UFRN * Giselle Reis, CMU-Qatar PROGRAM COMMITTEE CO-CHAIRS * Amy Felty, University of Ottawa (chair) * João Marcos, UFRN (chair) PROGRAM COMMITTEE * Beniamino Accattoli, INRIA Saclay * Sandra Alves, University of Porto * Mario Benevides, UFRJ * Ana Bove, Chalmers * Marco Cerami, UFBA * Valeria de Paiva, Nuance Communications * Maribel Fernandez, King's College London * Francicleber Ferreira, UFC * Erich Grädel, RWTH Aachen * Edward Hermann Haeusler, PUC-Rio * Oleg Kiselyov, Tohoku University * Björn Lellmann, TU Wien * Bruno Lopes, UFF * Favio Miranda-Perea, UNAM * Alberto Momigliano, University of Milano * Daniele Nantes, UnB * Pedro Quaresma, University of Coimbra * Florian Rabe, LRI Paris * Alexandre Rademaker, IBM-Brazil * Umberto Rivieccio, UFRN * Camilo Rocha, PUJ * Matthieu Sozeau, IRIF * Nora Szasz, Universidad ORT * Ivan Varzinczak, Université d’Artois * Daniel Ventura, UFG * Anna Zamansky, University of Haifa ORGANIZING COMMITTEE * Carlos Olarte, UFRN CONTACT * lsfa2019 at easychair.org ___ hol-info mailing list hol-info@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/hol-info
[Hol-info] SEFM 2019 - Call for Papers
Second Call for Papers SEFM 2019 17th International Conference on Software Engineering and Formal Methods Oslo, Norway, September 16-20, 2019 http://sefm2019.inria.fr Twitter: @SEFM_conf - IMPORTANT DATES Abstract submission deadline: May 3, 2019 (AoE) Paper submission deadline: May 10, 2019 (AoE) Notification: June 25, 2019 Conference: September 16-20, 2019 OVERVIEW AND SCOPE SEFM aims to bring together leading researchers and practitioners from academia, industry, and government, to advance the state of the art in formal methods, to facilitate their uptake in the software industry, and to encourage their integration within practical software engineering methods and tools. Topics of interest include, but are not limited to, the following aspects of software engineering and formal methods: # Software Development Methods - Formal modeling, specification, and design - Software evolution, maintenance, re-engineering, and reuse # Design Principles - Programming languages - Domain-specific languages - Type theory - Abstraction and refinement # Software Testing, Validation, and Verification - Model checking, theorem proving, and decision procedures - Testing and runtime verification - Statistical and probabilistic analysis - Synthesis - Performance estimation and analysis of other non-functional properties - Other light-weight and scalable formal methods # Security and Safety - Security, privacy, and trust - Safety-critical, fault-tolerant, and secure systems - Software certification # Applications and Technology Transfer - Service-oriented and cloud computing systems, Internet of Things - Component, object, multi-agent and self-adaptive systems - Real-time, hybrid, and cyber-physical systems - Intelligent systems and machine learning - HCI, interactive systems, and human error analysis - Education # Case studies, best practices, and experience reports PAPER SUBMISSION We solicit two categories of papers: - Regular papers describing original research results, case studies, or surveys. Regular papers should not exceed 15 pages, excluding bibliography. - Tool papers that describe an operational tool and its contributions. Tool papers should not exceed 6 pages (including bibliography) and should include the URL of the tool. All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Paper submission is done via EasyChair at https://easychair.org/conferences/?conf=sefm2019 Papers must be formatted according to the guidelines for Springer LNCS papers (see http://www.springer.com/lncs). PUBLICATION All accepted papers will appear in the proceedings of the conference that will be published as a volume in Springer's LNCS series. The authors of a selected subset of accepted papers will be invited to submit extended versions of their papers to special issues of the journals "Software and Systems Modeling" and "Formal Methods in System Design." INVITED SPEAKERS Wil van der Aalst (RWTH Aachen University, Germany) David Basin (ETH Zurich, Switzerland) Koushik Sen (University of California, Berkeley, USA) PROGRAM CHAIRS Peter Csaba Ölveczky (University of Oslo, Norway) Gwen Salaün (Université Grenoble Alpes, France) PROGRAM COMMITTEE Erika Abraham (RWTH Aachen University, Germany) Cyrille Artho (KTH Royal Institute of Technology, Sweden) Kyungmin Bae (Pohang University of Science and Technology, South Korea) Olivier Barais (University of Rennes, France) Luis Barbosa (University of Minho, Portugal) Dirk Beyer (LMU Munich, Germany) Roberto Bruni (University of Pisa, Italy) Ana Cavalcanti (University of York, UK) Alessandro Cimatti (FBK-irst, Italy) Robert Clariso (Open University of Catalonia, Spain) Rocco De Nicola (IMT School for Advanced Studies Lucca, Italy) John Derrick (Unversity of Sheffield, UK) José Luiz Fiadeiro (Royal Holloway, University of London, UK) Osman Hasan (National University of Sciences & Technology, Pakistan) Klaus Havelund (Jet Propulsion Laboratory, US) Reiko Heckel (University of Leicester, UK) Marieke Huisman (University of Twente, The Netherlands) Alexander Knapp (Augsburg University, Germany) Nikolai Kosmatov (CEA LIST, France) Frederic Mallet (Université Nice Sophia Antipolis, France) Tiziana Margaria (Lero, Ireland) Hernan Melgratti (University of Buenos Aires, Argentina) Madhavan Mukund (Chennai Mathematical Institute, India) Marc Pantel (IRIT/INPT, Université de Toulouse, France) Anna Philippou (University of Cyprus) Grigore Rosu (University of Illinois, US) Augusto Sampaio (Federal university of Pernambuco, Brazil) Cesar Sanchez (IMDEA Software Institute, Spain) Ina Schaefer (Technische
