Search results for "Programming language"
showing 10 items of 624 documents
Generation of User Interfaces from Business Process Model Notation (BPMN)
2019
Business Process Model Notation focuses on functional processes; so, the design of the interface generally depends on the subjective experience of the analyst. This thesis proposes a new method to generate interfaces from BPMN models. The idea is to identify rules from BPMN to interfaces in existing real projects. We have analyzed 7 Bizagi projects to generalize a list of rules. It has been done considering five BPMN patterns. Apart from BPMN primitives, there are rules that depend on elements of Class Diagrams to know how to generate the interfaces. When the rules have several alternatives to generate the interfaces, we need an unambiguous semantics to specify which alternative we are goin…
Architecture and Language for Semantic Reduction of Domain-Specific Models in BPMS
2012
Nowadays each business process management system (BPMS) supports either an industry standard or its own specific modeling language. But no BPMS supports a specific language for each organization. We propose an architecture for building BPMS that allows creating a domain-specific modeling language for every client easily. The main problem is to bridge the gap between the domain-specific language and the executable language. We show that we can look at this problem as a classification of the domain-specific language constructs in the terms of the executable language. To solve this problem we present a novel model transformation language, with which this type of problem can be solved more natu…
On the darker side of C++
1988
We discuss several negative features and properties of the C++ language, some common with C, others pertaining to C++ classes. Remedies are proposed for most of the latter ones, most of the former ones being feared to be already incurable. The worst class-related defects claimed in present C++ have to do with free store management. Some hints are given to programmers on how to avoid pitfalls.
Automatic construction of test sets: Practical approach
2005
The problem of symbolic execution and test generation is considered both for sequential and concurrent programs. Practical methods for test construction for the given program path are presented.
An offline partial evaluator for curry programs
2005
Narrowing-driven partial evaluation is a powerful technique for the specialization of functional logic programs. In this paper, we describe the implementation of a narrowing-driven partial evaluator for Curry programs which follows the offline approach to ensuring termination. Although the new partial evaluator is less precise than previous (online) partial evaluators for Curry, it is much faster and, thus, allows the specialization of larger programs.
Towards Diagrammatic Patterns
2008
This article presents the idea that the graphical representation (concrete syntax) of a visual language can be specified based on some pre-defined diagrammatic patterns. A diagram from the Specification and Description Language (SDL) is used as illustration.
LCL - A Graphical Meta-Language for Specification of Language Constraints
2015
The Object Constraint Language (OCL) is commonly used for constraints in meta-model-based language specifications. However, it may be advantageous to have a domain-specific constraint meta-language optimised for language specifications. A survey of OCL usage in language specifications has been performed, in order to gain an understanding of common constraint patterns. This is used as a starting point for defining a new meta-language for language constraints, Language Constraint Language (LCL), that has an intuitive graphical syntax.
Persistent software transactional memory in Haskell
2021
Emerging persistent memory in commodity hardware allows byte-granular accesses to persistent state at memory speeds. However, to prevent inconsistent state in persistent memory due to unexpected system failures, different write-semantics are required compared to volatile memory. Transaction-based library solutions for persistent memory facilitate the atomic modification of persistent data in languages where memory is explicitly managed by the programmer, such as C/C++. For languages that provide extended capabilities like automatic memory management, a more native integration into the language is needed to maintain the high level of memory abstraction. It is shown in this paper how persiste…
Concept Analysis in Programming Language Research : Done Well It Is All Right
2017
Programming language research is becoming method conscious. Rigorous mathematical or empirical evaluation is often demanded, which is a good thing. However, I argue in this essay that concept analysis is a legitimate research approach in programming languages, with important limitations. It can be used to sharpen vague concepts, and to expose distinctions that have previously been overlooked, but it does not demonstrate the superiority of one language design over another. Arguments and counter-arguments are essential to successful concept analysis, and such thoughtful conversations should be published more. peerReviewed
The Sliced COO Format for Sparse Matrix-Vector Multiplication on CUDA-enabled GPUs
2012
Abstract Existing formats for Sparse Matrix-Vector Multiplication (SpMV) on the GPU are outperforming their corresponding implementations on multi-core CPUs. In this paper, we present a new format called Sliced COO (SCOO) and an effcient CUDA implementation to perform SpMV on the GPU. While previous work shows experiments on small to medium-sized sparse matrices, we perform evaluations on large sparse matrices. We compared SCOO performance to existing formats of the NVIDIA Cusp library. Our resutls on a Fermi GPU show that SCOO outperforms the COO and CSR format for all tested matrices and the HYB format for all tested unstructured matrices. Furthermore, comparison to a Sandy-Bridge CPU sho…