37 papers:
HIMI-IKD-2015-FischerOFIW #framework #interface #multi #named #prototype #testing- URU: A Platform for Prototyping and Testing Compatibility of Multifunction Interfaces with User Knowledge Schemata (SF, BO, MF, MI, EW), pp. 151–160.
SAC-2012-CombiP #complexity #on the #workflow- On the complexity of temporal controllabilities for workflow schemata (CC, RP), pp. 60–66.
SIGMOD-2010-MagnaniM #named #nondeterminism- US-SQL: managing uncertain schemata (MM, DM), pp. 1195–1198.
LATA-2010-AravantinosCP #complexity #problem #satisfiability- Complexity of the Satisfiability Problem for a Class of Propositional Schemata (VA, RC, NP), pp. 58–69.
OOPSLA-2010-QuillienW #agile- Rubber ducks, nightmares, and unsaturated predicates: proto-scientific schemata are good for agile (JQ, DW), pp. 901–917.
IJCAR-2010-AravantinosCP #decidability- A Decidable Class of Nested Iterated Schemata (VA, RC, NP), pp. 293–308.
- IJCAR-2010-AravantinosCP10a #named #satisfiability
- RegSTAB: A SAT Solver for Propositional Schemata (VA, RC, NP), pp. 309–315.
CSL-2008-BonfanteKMO #recursion- Recursion Schemata for NCk (GB, RK, JYM, IO), pp. 49–63.
CAiSE-2005-MelloH #integration #named #process #xml- BInXS: A Process for Integration of XML Schemata (RdSM, CAH), pp. 151–166.
- SAC-2005-BaresiQ #documentation #graph transformation #xml
- Graph transformation to infer schemata from XML documents (LB, EQ), pp. 642–646.
- SAC-2004-NehabP
- Schemata Theory for the real coding and arithmetical operators (DFN, MACP), pp. 1006–1012.
SAS-2000-Mauborgne #termination- Tree Schemata and Fair Termination (LM), pp. 302–321.
TOOLS-USA-1999-SangalFLL #compilation #interactive- Interaction Schemata: Compiling Interactions to Code (NS, EF, KJL, DHL), p. 268–?.
LOPSTR-1997-RichardsonF #development #prolog #source code- Development of Correct Transformation Schemata for Prolog Programs (JR, NEF), pp. 263–281.
WIA-1996-Maurel #automaton- Building Automata on Schemata and Acceptability Tables: Application to French Data Adverbials (DM), pp. 72–86.
- LOPSTR-1996-Gegg-Harrison #logic programming
- Extensible Logic Program Schemata (TSGH), pp. 256–274.
- CAiSE-1995-RauhS #normalisation #standard
- Standard Transformations for the Normalization of ER Schemata (OR, ES), pp. 313–326.
- LOPSTR-1995-FlenerD #logic programming #program transformation
- Logic Program Transformation through Generalization Schemata (PF, YD), pp. 171–173.
ICLP-1995-Gegg-Harrison #logic programming #prolog #representation- Representing Logic Program Schemata in λ-Prolog (TSGH), pp. 467–481.
- LOPSTR-1993-Johansson #incremental #interactive #using
- Interactive Program Derivation Using Program Schemata and Incrementally Generated Strategies (ALJ), pp. 100–112.
ISSTA-1993-UntchOH #analysis #mutation testing #using- Mutation Analysis Using Mutant Schemata (RHU, AJO, MJH), pp. 139–148.
- LOPSTR-1991-Waldau #validation
- Formal Validation of Transformation Schemata (MW), pp. 97–110.
ML-1989-Shavlik #analysis #empirical #learning- An Empirical Analysis of EBL Approaches for Learning Plan Schemata (JWS), pp. 183–187.
- NACLP-1989-DevilleB #logic programming #source code #towards
- Generalization and Program Schemata: A Step Towards Computer-Aided Construction of Logic Programs (YD, JB), pp. 409–425.
PODS-1988-Hegner #component #composition #relational #strict- Decomposition of Relational Schemata into Components Defined by Both Projection and Restriction (SJH), pp. 174–183.
- ML-1988-Kadie #learning #named
- Diffy-S: Learning Robot Operator Schemata from Examples (CMK), pp. 430–436.
VLDB-1987-LenzeriniN #constraints #dependence #on the #satisfiability- On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata (ML, PN), pp. 147–154.
- PODS-1984-Hull #capacity #database #relational
- Relative Information Capacity of Simple Relational Database Schemata (RH), pp. 97–109.
- PODS-1984-SaccaMM #database #dependence #functional
- Properties of Database Schemata with Functional Dependencies (DS, FM, AM), pp. 19–28.
- VLDB-1983-Verroust #database #semantics
- Characterization of Well-Behaved Database Schemata and Their Update Semantics (AV), pp. 312–321.
- SIGMOD-1982-ImielinskiL82a #database
- A Technique for Translating States Between Database Schemata (TI, WLJ), pp. 61–68.
POPL-1977-Lewis #equivalence #problem- The Equivalence Problem for Program Schemata with Nonintersecting Loops (HRL), pp. 253–266.
ICALP-1974-MartelliM #programming- Dynamic Programming Schemata (AM, UM), pp. 66–80.
- ICALP-1974-Weihrauch #complexity
- The Compuational Complexity of Program Schemata (KW), pp. 326–334.
STOC-1972-ConstableM #decidability #equivalence #problem #recursion- Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems (RLC, SSM), pp. 1–17.
- STOC-1972-Plaisted
- Flowchart Schemata with Counters (DAP), pp. 44–51.
- STOC-1971-Constable
- Loop Schemata (RLC), pp. 24–39.
