5,252 Hits in 5.0 sec

A dataflow semantics for constraint logic programs [chapter]

Livio Colussi, Elena Marchiori, Massimo Marchiori
1995 Lecture Notes in Computer Science  
I n tr o d u c tio n In th is p ap er a dataflow sem antics for co nstraint logic program s (clp's for short) is introduced.  ...  A D ataflow S em a n tics for C o n stra in t L ogic P rogram s Livio C olussi1 A b s tr a c t. This paper introduces an alternative operational model for constraint logic programs.  ... 
doi:10.1007/bfb0026834 fatcat:jjnh5x4fpzezzis762iq32uowu

Lost in Translation: Forgetful Semantic Anchoring

Daniel Balasubramanian, Ethan K. Jackson
2009 2009 IEEE/ACM International Conference on Automated Software Engineering  
We demonstrate this problem of "forgetful" semantic anchoring using existing approaches through a translation from dataflow systems to interface automata.  ...  Assigning behavioral semantics to domain-specific languages (DSLs) opens the door for the application of formal methods, yet is largely an unresolved problem.  ...  Failure to construct a finite model for this query on the composed logic programs means that deadlock is a compositional property for this semantic anchoring. V.  ... 
doi:10.1109/ase.2009.83 dblp:conf/kbse/BalasubramanianJ09 fatcat:7eimbs6dxjactpgkt7mojay7ju

Semantics of multiway dataflow constraint systems

Magne Haveraaen, Jaakko Järvi
2020 Journal of Logical and Algebraic Methods in Programming  
Here we investigate a semantic setting for MDCS, introducing dataflow constraints as modules with explicit goals and related method sets.  ...  Multiway dataflow constraint systems (MDCS) is a programming model where statements are not executed in a predetermined order.  ...  Syntax and semantics of a multiple assignment language Here we define a programming model for multiway dataflow constraint systems as an abstract programming language, i.e., with abstract syntax and semantics  ... 
doi:10.1016/j.jlamp.2020.100634 fatcat:fg3rdlrctjch7dc7nmhlvtre7e

Page 4343 of Mathematical Reviews Vol. , Issue 2000f [page]

2000 Mathematical Reviews  
We propose to use Horn logic (and eventually constraint logic) instead of the 4-calculus to express denotational semantics.  ...  This is obtained by reversing the deduction process, which is usually applied in static-dataflow anal- ysis of logic programs, on generic, possibly abstract, domains for analysis.  ... 

Generating example data for dataflow programs

Christopher Olston, Shubham Chopra, Utkarsh Srivastava
2009 Proceedings of the 35th SIGMOD international conference on Management of data - SIGMOD '09  
We introduce and study the problem of generating example intermediate data for dataflow programs, in a manner that illustrates the semantics of the operators while keeping the example data small.  ...  Our techniques perform well on real dataflow programs used at Yahoo! for web analytics.  ...  Besides, for the purpose of understanding the semantics of a dataflow program, it is not necessary to provide a uniform sample of the program's output.  ... 
doi:10.1145/1559845.1559873 dblp:conf/sigmod/OlstonCS09 fatcat:jpepa7dpgnfapb33zp3ar6qt4m

Actor-Oriented Design of Scientific Workflows [chapter]

Shawn Bowers, Bertram Ludäscher
2005 Lecture Notes in Computer Science  
We first develop a formal model for scientific workflows based on an actor-oriented modeling and design approach, originally developed for studying models of complex concurrent systems.  ...  Scientific workflows are becoming increasingly important as a unifying mechanism for interlinking scientific data management, analysis, simulation, and visualization tasks.  ...  We express constraints from H in logic, thus requiring that structural and semantic types are expressed in a logic formalism as well.  ... 
doi:10.1007/11568322_24 fatcat:3tnd5abmdzdodn6533huwbpc4q

Page 4891 of Mathematical Reviews Vol. , Issue 95h [page]

1995 Mathematical Reviews  
Then we regard a logic program as a functional of functions of atom sequences. The functional is really a dataflow extracted from a logic program so that the dataflow preserves the same meaning.  ...  The FP program is a meaning-preserving program transformed from a given logic program.” 95h:68033 68N25 68Q25 Young, N.  ... 

A history of the Oz multiparadigm language

Peter Van Roy, Seif Haridi, Christian Schulte, Gert Smolka
2020 Proceedings of the ACM on Programming Languages (PACMPL)  
Constraint Logic Programming. Another major step in logic programming research was the invention of constraint logic programming as a generalization of Prolog.  ...  This work went primarily in two directions, which are known as concurrent logic programming and constraint logic programming. Concurrent Logic Programming.  ...  From the viewpoint of logic, all these paradigms are forms of logic programming that perform deductions which add information to the constraint store.  ... 
doi:10.1145/3386333 fatcat:sznttm7q3nhedfm5hcue7x76di

Sessional dataflow

Dominic Duggan, Jianhua Yao
2012 Proceedings of the 7th workshop on Declarative aspects and applications of multicore programming - DAMP '12  
The purpose of sessional dataflow is to provide a compositional semantics for dataflow computations that can be scheduled at compile-time.  ...  This account focuses on a simplified case of sessional dataflow, to draw out the key points of the approach.  ...  Our actor semantics is effectively a limited form of cyclostatic dataflow [2] . In the latter, an actor has a finite state control logic, and transitions between states of this logic on each firing.  ... 
doi:10.1145/2103736.2103744 dblp:conf/popl/DugganY12 fatcat:zg2dtbk4erbcfd5fjlorpvrvsq

Page 4535 of Mathematical Reviews Vol. , Issue 93h [page]

1993 Mathematical Reviews  
Summary: “A framework for efficient dataflow analyses of logic programs is investigated.  ...  to constraint logic programs.  ... 

Automating State Management in Computational Notebooks

Stephen Macke
2021 Conference on Innovative Data Systems Research  
To reduce errors and reproducibility problems in notebooks, we propose that, just as a relational database pushes responsibility of managing data integrity from application logic to a DBMS, we need ways  ...  it too (keeping existing notebook semantics)?  ...  Obedience of Dataflow Constraints.  ... 
dblp:conf/cidr/Macke21 fatcat:lioxkg5mqfhajh77ydwxvqn7zq

Teaching Programming Broadly and Deeply: The Kernel Language Approach [chapter]

Peter Van Roy, Seif Haridi
2003 IFIP Advances in Information and Communication Technology  
them into a programming language • Doing programming well requires two topics: -A technology: a set of practical techniques, tools, and standards -A practical scientific foundation: a scientific theory  ...  that explains the technology and that is useful for the practicing programmer • Teaching programming requires teaching both the technology and the science -Surprisingly, programming is not taught in this  ...  concurrent • It is logic programming with higher-order procedures and without search -Higher-order is a powerful way to structure logic programs -Search is not necessary for most practical logic programs  ... 
doi:10.1007/978-0-387-35619-8_6 fatcat:rml6y3aeubcfnefpz226yzalw4

Page 5000 of Mathematical Reviews Vol. , Issue 96h [page]

1996 Mathematical Reviews  
Debray, Formal bases for dataflow analysis of logic programs (115-182); Krzysztof R.  ...  “The chapter by Debray gives a broad overview of the field of dataflow analysis of logic programs.  ... 

An Architectural Approach to End User Orchestrations [chapter]

Vishal Dwivedi, Perla Velasco-Elizondo, Jose Maria Fernandes, David Garlan, Bradley Schmerl
2011 Lecture Notes in Computer Science  
To address this problem, this paper proposes a composition approach based on an end user specification style called SCORE.  ...  SCORE is an architectural style that uses high-level constructs that can be tailored for different domains and automatically translated into executable constructs by tool support.  ...  Additional support was provided by the Center for Computational Analysis of Social and Organizational Systems  ... 
doi:10.1007/978-3-642-23798-0_39 fatcat:iushgkb5fvcu7ah3cdk4aekgh4

Analyzing logic programs with dynamic scheduling

Kim Marriott, María José García de la Banda, Manuel Hermenegildo
1994 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94  
We give a framework for the global analysis of logic programming languages with dynamic scheduling and show that program analysis based on this framework supports optimizations which remove much of the  ...  Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule.  ...  [24] which gives a dataflow analysis for a logic programming language in which negated calis are delayed until their arguments are fully ground.  ... 
doi:10.1145/174675.177883 dblp:conf/popl/MarriottBH94 fatcat:gdj52htaonchjikjnwneoa2i6u
« Previous Showing results 1 — 15 out of 5,252 results