Jeremiahwillcock Arun Chauhan · 2013
Many scientific applications are written in a Bulk Synchronous Parallel style, in which regions of pure computation are separated by communication operations. Unless an existing MPI collective operation can be used, these communication operations are usually written as separate message sends and receives, making analysis and optimization difficult. This style of communication also reduces readability and maintainability by hiding the overall collective pattern in a maze of individual messages. Instead we advocate directly specifying (collective) communication operations in a domain-specific language. We further classify applications by theircommunicationpatterns,inparticularwithrespecttodifferent nodes ’ knowledge of the applications ’ patterns and the frequency of patternchanges, showing how a language would benefit each of these classes of applications and the requirements for such a language. CategoriesandSubjectDescriptors D.1.3[Programmingtechniques]: Concurrent programming—Parallel programming; D.3.3 [Programming languages]: Language constructs and features— Concurrent programming structures
Cited by 0
Stephen Marshall · 2005
[Version for publication] The purpose of this document is to set out a series of issues relating to ‘urban pattern specification ’ in connection with the SOLUTIONS project (Sustainability of Land Use and Transport In Outer NeighbourhoodS). In doing so it serves both to present a general background to the role and relevance of the ‘pattern specification ’ component of the SOLUTIONS project, and to air parts of the ongoing work within the project, for the purposes of discussion and feedback at the Cambridge Symposium. It is therefore not the ‘final word ’ on the topic but a snapshot of work that is currently under ongoing development. 1.
Cited by 0
Richard Bubel, Reiner Hähnle · Chalmers Publication Library (Chalmers University of Technology) · 2007
Cited by 1
Boyan Onyshkevych · 2008
This paper describes the Common Pattern Specification Language (CPSL) that was developed during the TIPSTER program by a committee of researchers from the TIPSTER research sites. Many information extraction systems work by matching regular expressions over the lexical features of input symbols. CPSL was designed as a language for specifying such finite-state grammars for the purpose of specifying information extraction rules in a relatively system-independent way. The adoption of such a common language would enable the creation of shareable resources for the development of rule-based information extraction systems. 1. THE NEED FOR CPSL As researchers have gained experience with information extraction systems, there has been some convergence of system architecture among those systems based on the knowledge engineering approach of developing sets of rules more or less by hand, targeted toward specific sub-jects. Some rule-based systems have achieved very high performance on such tasks as name identification. Ide-ally, developers of information extraction systems
Cited by 0
Douglas E. Appelt, Boyan Onyshkevych · 1998
Cited by 22
Kanjana Thongglin, Sylviane Cardey, Peter Greenfield · 2013
Although natural language has been widely accepted for writing software requirements specifications but writing skills are still needed for software engineers. Ambiguities are often encountered in requirements since software engineers do not have good writing skills or writing experience. In this study, we present a Thai software requirements specification pattern by using controlled syntax. Our pattern can help software engineers to answer the questions: “How to start writing software requirements specification?” and “What information should be gathered?”. Each component of the pattern is designed and described based on our controlled syntax.
Cited by 8
Cell Differentiation · 1985
Cited by 0
Torsten Hoefler, Jeremiah Willcock, Arun Chauhan et al. · 2010
Many scientific applications are written in a Bulk Synchronous Parallel style, in which regions of pure computation are separated by communication operations. Unless an existing MPI collective operation can be used, these communication operations are usually written as separate message sends and receives, making analysis and optimization difficult. This style of communication also reduces readability and maintainability by hiding the overall collective pattern in a maze of individual messages. Instead we advocate directly specifying (collective) communication operations in a domain-specific language. We further classify applications by their communication patterns, in particular with respect to different nodes ’ knowledge of the applications ’ patterns and the frequency of pattern changes, showing how a language would benefit each of these classes of applications and the requirements for such a language. Categories and Subject Descriptors D.1.3 [Programming techniques]: Concurrent programming—Parallel programming; D.3.3 [Programming languages]: Language constructs and features— Concurrent programming structures
Cited by 2
Ian Oliver · 2005
Formally specified invariants on UML models greatly enhance the correctness of the model by restricting the state space such that invalid scenarios that are admitted by the class diagram can be forbidden. Identification of these invariants in the situations where objects may or may not be shared is critical to the development of the model. Simple patterns based upon “shapes ” or patterns that exist in the class diagram can be applied to assist the developer in finding suitable places for these invariants and thus improving the preciseness or rigor of the models and the correctness of the system under development.
Cited by 0
Austin Ollar · Zenodo (CERN European Organization for Nuclear Research) · 2025
AbstractThe First Pattern is a universal four stage model for how information emerges, stabilizes, integrates, and propagates across domains such as computation, human behavior, biology, and physics. This document fixes the canonical terms, operators, and the minimum set of axioms for a testable TFP system. Algorithms, proofs, and benchmark results are out of scope for this version. The purpose is a stable, citable reference for research and implementation. Core terms• Origin Four, stages: Q1 Potential; Q2 Selection; Q3 Transformation; Q4 Deployment.• Stage 4 submodes: 4A Propagation; 4B Reorientation.• Operators: Explore inward (E_in), Bind inward (B_in), Bind outward (B_out), Explore outward (E_out) • Loops/Cycles: Information Emergence Cycle and Energy Integration Loop • State: S_t = [stage_t, z_t], with stage_t in {1,2,3,4} • Coherence: c_t in [0,1] measuring cycle integrity Recommended citationOllar, A. (2025). The First Pattern: Core Specification v1.0.0. Zenodo. https://doi.org/10.5281/zenodo.17556412 Contact: austin@austinollar.com
Cited by 0Open access
Isabel Dı́az, Francisca Losavio, Alfredo Matteo et al. · Information & Management · 2004
Cited by 35
Austin Ollar · Zenodo (CERN European Organization for Nuclear Research) · 2025
AbstractThe First Pattern is a universal four stage model for how information emerges, stabilizes, integrates, and propagates across domains such as computation, human behavior, biology, and physics. This document fixes the canonical terms, operators, and the minimum set of axioms for a testable TFP system. Algorithms, proofs, and benchmark results are out of scope for this version. The purpose is a stable, citable reference for research and implementation. Core terms• Origin Four, stages: Q1 Potential; Q2 Selection; Q3 Transformation; Q4 Deployment.• Stage 4 submodes: 4A Propagation; 4B Reorientation.• Operators: Explore inward (E_in), Bind inward (B_in), Bind outward (B_out), Explore outward (E_out) • Loops/Cycles: Information Emergence Cycle and Energy Integration Loop • State: S_t = [stage_t, z_t], with stage_t in {1,2,3,4} • Coherence: c_t in [0,1] measuring cycle integrity Recommended citationOllar, A. (2025). The First Pattern: Core Specification v1.0.0. Zenodo. https://doi.org/10.5281/zenodo.17556412 Contact: austin@austinollar.com
Cited by 0Open access
Roman Gumzej · Studies in computational intelligence · 2016
Cited by 0
Guidotti, Dario, Pandolfo, Laura, Pulina, Luca et al. · Zenodo (CERN European Organization for Nuclear Research) · 2024
This dataset contains 1000 requirements written in the Property Specification Pattern (PSP) format, specifically tailored for the automotive domain. The dataset serves as a valuable resource for researchers and practitioners working on the formal verification of automotive software, providing a comprehensive set of standardized requirements that can be used for validation, testing, and benchmarking of verification tools and methodologies.
Cited by 0Open access
Nayebi, Maleknaz · PolyPublie (École Polytechnique de Montréal) · 2010
Cited by 0
Marshall, S, Gong, Y · UCL Discovery (University College London) · 2009
Cited by 0
Maged Elaasar, Lionel Briand, Yvan Labiche · 2016
Abstract. This paper presents the Pattern Modeling Framework (PMF), a new metamodeling approach to pattern specification for MOF-compliant modeling frameworks and languages. Patterns need to be precisely specified before a tool can manipulate them, and though several approaches to pattern specification have been proposed, they do not provide the scalability and flexibility required in practice. PMF provides a pattern specification language called Epattern, which is capable of precisely specifying patterns in MOF-compliant metamod-els. The language is defined as an extension to MOF by adding semantics in-spired from the UML composite structure diagram. The language also comes with a graphical notation and a recommended iterative specification process. It also contains features to manage the complexity of specifying patterns and sim-plify their application and detection in user models. Most importantly, the lan-guage is implemented using state-of-the-art technologies that are heavily used by major modeling tool vendors, thus facilitating its adoption. 1
Cited by 1
Salman Khwaja, Mohammad Alshayeb · ACM Computing Surveys · 2016
A design pattern is a well-defined solution to a recurrent problem. Over the years, the number of patterns and domains of design patterns have expanded, as the patterns are the experiences of the experts of the domain captured in a higher-level abstraction. This led others to work on languages for design patterns to systematically document abstraction detailed in the design pattern rather than capture algorithms and data. These design-pattern specification languages come in different flavors, targeting different aspects of design patterns. Some design-pattern specification languages tried to capture the description of the design pattern in graphical or textual format, others tried to discover design patterns in code or design diagrams, and still other design-pattern specification languages have other objectives. However, so far, no effort has been made to compare these design-pattern specification languages and identify their strengths and weaknesses. This article provides a survey and a comparison between existing design-pattern specification languages using a design-pattern specification language evaluation framework. Analysis is done by grouping the design-pattern specification languages into different categories. In addition, a brief description is provided regarding the tools available for the design-pattern specification languages. Finally, we identify some open research issues that still need to be resolved.
Cited by 20
Alberto Tagliaferro, Livia Lestingi, Matteo Rossi · 2024
Smart cyber agents play a crucial role in software-intensive systems by monitoring their physical surroundings and making impactful decisions. This paper addresses the challenge of specifying multi-agent patterns, which include interactions with human agents in possibly safety-critical environments. To this end, we introduce the foundations of a domain-agnostic and flexible Domain-Specific Language (DSL) called LIrAs. The language is designed to be accessible to users without programming expertise. LIrAs' semantics are mapped to Deterministic Finite-state Automata, making specifications amenable to formal verification. The DSL is exemplified through an illustrative scenario from the service robotics field.
Cited by 2Open access
Gerd J�rgens, Elisabeth Gateff · Development Genes and Evolution · 1979
Cited by 37