Filters








9,259 Hits in 5.3 sec

Boolean operations and inclusion test for attribute–element constraints

Haruo Hosoya, Makoto Murata
2006 Theoretical Computer Science  
In this paper, we investigate intersection and difference operations and inclusion test for attribute-element constraints, in view of their importance in static typechecking for XML processing programs  ...  While early schema languages mainly focused on the element structure, Clark first paid an equal attention to attributes by allowing both element and attribute constraints in a single constraint expression  ...  Theorem 4. nemp(c) n = true if and only if Proof. The "only if" direction immediately follows from Lemma 7. For the "if" direction, suppose that H ٛ v ∈ c for some v and let |v| = h + 1.  ... 
doi:10.1016/j.tcs.2006.05.004 fatcat:mxs7wrr3kjg7ro62kqaullxu3a

Constraints

Raúl Mazo, Camille Salinesi, Daniel Diaz, Olfa Djebbi, Alberto Lora-Michiels
2012 International Journal of Information System Modeling and Design  
Specifying boolean, arithmetic, symbolic and reified constraint, provides a power of expression that spans beyond that provided by the boolean dependencies in FODA models.  ...  Tests performed on a benchmark of 50 PL models show that the approach is efficient and scales up easily to very large and complex PL specifications.  ...  Raúl Mazo is an Adjunct Assistant Lecturer at the Panthéon Sorbonne University and at the Engineering School EFREI, both located in Paris, France.  ... 
doi:10.4018/jismd.2012040102 fatcat:u2ew6zubmnevzjk6jnju7mgdre

Constraints: The core of product line engineering

Camille Salinesi, Raul Mazo, Olfa Djebbi, Daniel Diaz, Alberto Lora-Michiels
2011 2011 FIFTH INTERNATIONAL CONFERENCE ON RESEARCH CHALLENGES IN INFORMATION SCIENCE  
Constraint programming, and in particular Boolean constraint programming, has been used so far to support analysis of variability models such as Feature-Oriented Domain Analysis (FODA) and the like.  ...  For instance, many constraints that were needed in the cases we explored cannot be specified with dependencies of existing product line modelling languages.  ...  Operators are of two types: those for defining constraints (Constraint Operators) and those for solving constraints (Resolution Operators). Constraint Operators are used to specify PLs.  ... 
doi:10.1109/rcis.2011.6006825 dblp:conf/rcis/SalinesiDMDL11 fatcat:ls2o5wjw2zd7riparvrb22v2hy

Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations [chapter]

Hendrik Radke, Thorsten Arendt, Jan Steffen Becker, Annegret Habel, Gabriele Taentzer
2015 Lecture Notes in Computer Science  
The main idea is to use the characteristic function of sets to translate set operations to corresponding Boolean operations.  ...  This integration can be advantageously used for optimizing DSML definition. Generally, a meta-model is translated to a type graph with a set of nested graph constraints.  ...  We are grateful to the anonymous referees for their helpful comments on a draft version of this paper.  ... 
doi:10.1007/978-3-319-21145-9_10 fatcat:7btz6gudrffuhoao6kaauafxle

Modelling Digital Circuits Problems with Set Constraints [chapter]

Francisco Azevedo, Pedro Barahona
2000 Lecture Notes in Computer Science  
Boolean SAT tool).  ...  A number of diagnostic and optimisation problems in Electronics Computer Aided Design have usually been handled either by specific tools or by mapping them into a general problem solver (e.g. a propositional  ...  We would also like to thank the anonymous referees and Carmen Gervet for their helpful comments.  ... 
doi:10.1007/3-540-44957-4_28 fatcat:avh4k77mxjbcxf7iqcwzsyn7ce

v1e: A Kernel for Domain-specific Textual Variability Modelling Languages

Stefan Sobernig, Olaf Lessenich
2021 15th International Working Conference on Variability Modelling of Software-Intensive Systems  
., representing attributed variability models) and future directions (e.g., analysis support beyond BDD).  ...  As a language kernel, v1e provides a minimal but extensible set of abstractions to implement families of domain-specific languages for textual variability modelling. v1e provides for a small and versatile  ...  Textual constraints provide a small subset of Boolean expressions, including the binary operators and and or as well as the unary operator not.  ... 
doi:10.1145/3442391.3442396 fatcat:i3igskoiirbf3gc5nrwx5zdqa4

From Core OCL Invariants to Nested Graph Constraints [chapter]

Thorsten Arendt, Annegret Habel, Hendrik Radke, Gabriele Taentzer
2014 Lecture Notes in Computer Science  
In this paper, we consider meta-models with Core OCL invariants and translate them to nested graph constraints for typed attributed graphs.  ...  The aim of this work is to establish a first formal relation between meta-modeling and the theory of graph transformation including constraints to come up with an integrated approach for defining modeling  ...  We are grateful to Christoph Peuser and the anonymous referees for their helpful comments on a draft version of this paper.  ... 
doi:10.1007/978-3-319-09108-2_7 fatcat:5fraydx3dfef7jj3hmu3n3c5xa

RDB2 Model: A Relational Databases Retro-Design Tool Enriched by the Extraction of Constraints

Widad Jakjoud, Mohamed Bahaj
2017 Journal of Software  
In this paper, we present a method that retro-designs a relational database to generate a conceptual model by extracting data structures and constraints: Our method extracts a conceptual model directly  ...  The second stage involves the extraction of relational constraints and the semantic enrichment of the conceptual model by improving the understanding of relationships between data structures.  ...  For each test, a constraint is generated with the Boolean value True or False. Rule 5: generation of constraints between associations (R_CI): Only inter-associations constraints will be treated.  ... 
doi:10.17706/jsw.12.6.426-438 fatcat:p5jyjicigjcmtg3ofw5sah46ya

Standard conformance test specification language TTCN

Behcet Sarikaya, A Wiles
1992 Computer Standards & Interfaces  
For application layer protocols, Abstract Syntax Notation One (ASN.l) constraints are used.  ...  The International Standards Organization (ISO) has defined a protocol test language called TTCN (Tree and Tabular Combined Notation) to specify abstract test suites for Open Systems Interconnection (OS  ...  The predefined relational operators are '= ', '< ', '> ', ·o, 1 > = ', '< =' and Boolean operators are NOT, AND and OR.  ... 
doi:10.1016/0920-5489(92)90054-h fatcat:7hmy4o2jdrbixk7rn2syrtkgm4

Using constraint programming to verify DOPLER variability models

Raul Mazo, Paul Grünbacher, Wolfgang Heider, Rick Rabiser, Camille Salinesi, Daniel Diaz
2011 Proceedings of the 5th Workshop on Variability Modeling of Software-Intensive Systems - VaMoS '11  
While many authors have proposed approaches for verifying feature models there is so far no such approach for decision models.  ...  We present a preliminary approach that converts DOPLER variability models into constraint programs to support their verification.  ...  We use the constraint solver GNU Prolog [6] but other solvers may also be used to execute these operations, if they support Boolean and arithmetic constraints over integer values (an example would be  ... 
doi:10.1145/1944892.1944904 dblp:conf/vamos/MazoGHRSD11 fatcat:mtzyrnagpndodfqachiyrvx7t4

Author index

2006 Theoretical Computer Science  
Murata, Boolean operations and inclusion test for attribute-element constraints (1-3) 327-351 Jiang, Y., see G. Dowek (1-3) 193-208 Kiss, Á ., see D. Binkley (1-3) 23-41 Korel, B., see D.  ...  ., LTL over integer periodicity constraints (1-3) 96-123 Dougherty, D.J. and C. Gutie´rrez, Normal forms for binary relations (1-3) 228-246 Dowek, G. and Y.  ... 
doi:10.1016/s0304-3975(06)00474-9 fatcat:eg5moz4ozbcupblfpxf4ywg5be

Abstract Domains and Solvers for Sets Reasoning [chapter]

Arlen Cox, Bor-Yuh Evan Chang, Huisong Li, Xavier Rival
2015 Lecture Notes in Computer Science  
To address the simultaneous challenges of scalability and precision, we formalize and implement an interface for symbolic set abstractions and construct multiple abstract domains relying on both specialized  ...  Symbolic set abstractions provide building blocks that can be used to partition elements, relate partitions to other partitions, and determine the provenance of multiple values, all without knowing any  ...  This material is based upon work supported in part by a Chateaubriand Fellowship, by the National Science Foundation under Grant Numbers CCF-1055066 and CCF-1218208, and by the European Research Council  ... 
doi:10.1007/978-3-662-48899-7_25 fatcat:5uroddordjfvnjagt4qetgyb74

Advanced STEP parameterised and constrained features for reverse engineering

Sebastien Remy, Guillaume Ducellier, Sebastien Charles, Benoit Eynard
2008 International journal of computer applications in technology  
Last, the reconstruction methodology is detailed and is illustrated with examples.  ...  The paper presents an interactive approach for RE of mechanical part designed using feature.  ...  In addition to Part 108, the case-test also implements Part 55 capabilities to represent the sequence of Boolean operations performed on plane and cylindrical surfaces.  ... 
doi:10.1504/ijcat.2008.019484 fatcat:xgntjg3hlba7tcfvelrohrlwk4

The DSD Schema Language and its Applications

Nils Klarlund, Anders Møller, Michael I. Schwartzbach
2000 BRICS Report Series  
We also support a general, declarative mechanism for inserting default elements and attributes that is reminiscent of Cascading<br />Style Sheets (CSS), a way of manipulating formatting instructions in  ...  We advocate the use of nonterminals in a top-down manner, coupled with boolean logic and regular expressions to describe how constraints on tree nodes depend on their context.  ...  The presence and values of declared attributes can be tested in boolean expressions and context patterns.  ... 
doi:10.7146/brics.v7i41.20208 fatcat:w6ryjcgasbetpfli44nwaua6cq

Pluggable Analysis Viewpoints for Design Space Exploration

Michael Masin, Lior Limonad, Aviad Sela, David Boaz, Lev Greenberg, Nir Mashkif, Ran Rinat
2013 Procedia Computer Science  
Splitting various elements and corresponding constraints into different perspectives of interests, enables separation of concerns such as domains of expertise, levels of abstraction, and stages in lifecycle  ...  Viewpoint modeling is an effective approach for analyzing and designing complex systems.  ...  Henry Broodney and Mr. Sergey Zolotnitsky for fruitful discussions.  ... 
doi:10.1016/j.procs.2013.01.024 fatcat:twfgxk6tbbfnndxproo7md2s2y
« Previous Showing results 1 — 15 out of 9,259 results