Search results
From MaRDI portal
- ubWikidataQ93398267 ScholiaQ93398267MaRDI QIDQ421457 This page was built for person: Torsten Schaub...10 bytes (16 words) - 19:59, 11 December 2023
- zbMath Open futatsugi.kokichiMaRDI QIDQ520243 This page was built for person: Kokichi Futatsugi...10 bytes (13 words) - 07:57, 7 October 2023
- zbMath Open NoneMaRDI QIDQ1223001 This page was built for person: K. Appert...10 bytes (12 words) - 10:19, 24 September 2023
- algebrasforgetful functorsabstract algebraic institutionsfree functorslogical system for writing specificationsspecifications of abstract data types Mathematics Subject...15 bytes (574 words) - 01:05, 31 January 2024
- total stable model semantics Writing Declarative Specifications for Clauses A paraconsistent logic programming approach for querying inconsistent databases...15 bytes (940 words) - 19:35, 6 February 2024
- type constraints Specification and verification challenges for sequential object-oriented programs An assertion-based proof system for multithreaded Java...15 bytes (250 words) - 13:59, 1 February 2024
- simple models Writing Declarative Specifications for Clauses NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment Superposition for Bounded Domains...15 bytes (320 words) - 00:45, 5 February 2024
- Computation Rules for Recursive Languages On the Definition of Computable Function of a Real Variable Lucid—A Formal System for Writing and Proving Programs...15 bytes (1,635 words) - 10:26, 30 January 2024
- Observational equivalences for linear logic concurrent constraint languages Logic Programming with Focusing Proofs in Linear Logic A type system for borrowing permissions...15 bytes (533 words) - 15:58, 7 February 2024
- problems Logical systems for structured specifications. Logical foundations of CafeOBJ Formal Methods for Open Object-Based Distributed Systems Structural...15 bytes (386 words) - 15:16, 1 February 2024
- page was built for publication: Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs Report a bug (only for logged in users...15 bytes (372 words) - 01:46, 9 February 2024
- look at termination An axiomatic basis for proving total correctness of goto-programs Lucid—A Formal System for Writing and Proving Programs Axiomatic approach...15 bytes (397 words) - 03:48, 31 January 2024
- behavioural semantic model for distributed systems A partial ordering semantics for CCS Flush primitives for asynchronous distributed systems Virtual time and virtual...15 bytes (914 words) - 10:44, 6 February 2024
- Published in: Logical Methods in Computer Science (Search for Journal in Brave) Abstract: Writing formal specifications for distributed systems is difficult...15 bytes (437 words) - 21:58, 3 February 2024
- Intensional Semantics for Elementary Program Transformations 👍 👎 This page was built for publication: A Kripke logical relation for effect-based program...15 bytes (361 words) - 10:22, 3 February 2024
- logics 👍 👎 Writing out unifiers for formulas with coefficients in intuitionistic logic 👍 👎 Sound and complete Gentzen deduction system for intermediate...15 bytes (381 words) - 20:02, 4 February 2024
- logics Generate & Check Method for Verifying Transition Systems in CafeOBJ Formal Methods for Open Object-Based Distributed Systems Removing redundant arguments...15 bytes (274 words) - 06:14, 1 February 2024
- date: 15 December 2016 Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave) Abstract: Engineering needs mathematics...15 bytes (515 words) - 18:16, 2 February 2024
- and Transformations for Non-deterministic Programs A Kripke logical relation for effect-based program transformations Algebras for Parameterised Monads...15 bytes (215 words) - 00:56, 9 February 2024
- scunac This page was built for publication: A User-friendly Interface for a Lightweight Verification System Report a bug (only for logged in users!)Click here...15 bytes (219 words) - 15:45, 8 February 2024
