Results 21 to 30 of about 65,035 (289)
On Counterexample Guided Quantifier Instantiation for Synthesis in CVC4 [PDF]
, 2015 We introduce the first program synthesis engine implemented inside an SMT solver. We present an approach that extracts solution functions from unsatisfiability proofs of the negated form of synthesis conjectures.
Barrett, Clark +4 more
core +2 more sources
Testing Transitivity of Preferences on Two-Alternative Forced Choice Data
Frontiers in Psychology, 2010 As Duncan Luce and other prominent scholars have pointed out on several occasions, testing algebraic models against empirical data raises difficult conceptual, mathematical, and statistical challenges.
Michel Regenwetter +2 more
doaj +1 more source
An algebraic semantics for QVT-relations check-only transformations [PDF]
, 2012 Fundamenta Informaticae, 114 1, Juan de Lara, Esther Guerra, An algebraic semantics for QVT-relations check-only transformations, 73-101, Copyright 2012, with permission from IOS PressQVT is the standard for model transformation defined by the OMG in ...
Guerra, Esther, Lara, Juan de
core +2 more sources
Revista Facultad de Ingeniería Universidad de Antioquia, 2012 The specification and formal verification of distributed systems is usually a complex task. It requires extensive knowledge of algorithm theory and modeling of distributed or concurrent systems.
Jorge Cortés Galicia +2 more
doaj +1 more source
Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Parameterised Boolean Equation Systems (PBESs) are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal mu-calculus formulae for process algebraic specifications with data.
Gijs Kant, Jaco van de Pol
doaj +1 more source
The foundational legacy of ASL [PDF]
, 2015 . We recall the kernel algebraic specification language ASL and outline its main features in the context of the state of research on algebraic specification at the time it was conceived in the early 1980s. We discuss the most significant new ideas in ASL
Sannella, Donald, Tarlecki, Andrzej
core +2 more sources
Using ACL2 in the Design of Efficient, Verifiable Data Structures for High-Assurance Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Verification of algorithms and data structures utilized in modern autonomous and semi-autonomous vehicles for land, sea, air, and space presents a significant challenge.
David Hardin, Konrad Slind
doaj +1 more source
On the power of algebraic specifications [PDF]
, 1981 We study the expressive power of different algebraic specification methods. In contrast to (nonhierarchical) initial and terminal algebra specifications which correspond to semicomputable and cosemicomputable algebras, hierarchical specifications — as e.g.
Bergstra, J.A. +3 more
openaire +2 more sources
Approximability in the GPAC [PDF]
Logical Methods in Computer Science, 2019 Most of the physical processes arising in nature are modeled by either ordinary or partial differential equations. From the point of view of analog computability, the existence of an effective way to obtain solutions of these systems is essential.
Diogo Poças, Jeffery Zucker
doaj +1 more source
Forecasting methodology with structural auto-adaptive intelligent grey models
MethodsX, 2023 Accurate mid- and long-term petroleum products (PP) consumption forecasting is vital for strategic reserve management and energy planning. In order to address the issue of energy forecasting, a novel structural auto-adaptive intelligent grey model (SAIGM)
Flavian Emmanuel Sapnken +1 more
doaj +1 more source