Log in

Relevant bibliographies by topics / Computer language verification / Journal articles

To see the other types of publications on this topic, follow the link: Computer language verification.

Journal articles on the topic 'Computer language verification'

Author: Grafiati

Published: 4 June 2021

Last updated: 15 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Computer language verification.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Dold, Axel, Friedrich von Henke, and Wolfgang Goerigk. "A Completely Verified Realistic Bootstrap Compiler." International Journal of Foundations of Computer Science 14, no. 04 (August 2003): 659–80. http://dx.doi.org/10.1142/s0129054103001947.

Full text

Abstract:

This paper reports on a large verification effort in constructing an initial fully trusted bootstrap compiler executable for a realistic system programming language and real target processor. The construction and verification process comprises three tasks: the verification of the compiling specification (a relation between abstract source and target programs) with respect to the language semantics and a realistic correctness criterion. This proof has been completely mechanized using the PVS verification system and is one of the largest case-studies in formal verification we are aware of. Second, the implementation of the specification in the high-level source language following a transformational approach, and finally, the implementation and verification of a binary executable written in the compiler's target language. For the latter task, a realistic technique has been developed, which is based on rigorous a-posteriori syntactic code inspection and which guarantees, for the first time, trusted execution of generated machine programs. The context of this work is the joint German research effort Verifix aiming at developing methods for the construction of correct compilers for realistic source languages and real target processors.

APA, Harvard, Vancouver, ISO, and other styles

2

Sulzmann, Martin, and Răzvan Voicu. "Language-Based Program Verification via Expressive Types." Electronic Notes in Theoretical Computer Science 174, no. 7 (June 2007): 129–47. http://dx.doi.org/10.1016/j.entcs.2006.10.041.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Adamovic, Sasa, Vladislav Miskovic, Milan Milosavljevic, Marko Sarac, and Mladen Veinovic. "Automated language‐independent authorship verification (for Indo‐European languages)." Journal of the Association for Information Science and Technology 70, no. 8 (March 12, 2019): 858–71. http://dx.doi.org/10.1002/asi.24163.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

BOSSE, TIBOR, CATHOLIJN M. JONKER, LOURENS VAN DER MEIJ, ALEXEI SHARPANSKYKH, and JAN TREUR. "SPECIFICATION AND VERIFICATION OF DYNAMICS IN AGENT MODELS." International Journal of Cooperative Information Systems 18, no. 01 (March 2009): 167–93. http://dx.doi.org/10.1142/s0218843009001987.

Full text

Abstract:

Within many domains, among which biological, cognitive, and social areas, multiple interacting processes occur among agents with dynamics that are hard to handle. This paper presents the predicate logical Temporal Trace Language (TTL) for the formal specification and analysis of dynamic properties of agents and multi-agent systems. This language supports the specification of both qualitative and quantitative aspects, and therefore subsumes specification languages based on differential equations and qualitative, logical approaches. A software environment has been developed for TTL, which supports editing TTL properties and enables the formal verification of properties against a set of traces. The TTL environment proved its value in a number of projects within different biological, cognitive and social domains.

APA, Harvard, Vancouver, ISO, and other styles

5

Giorgetti, A., J. Groslambert, J. Julliand, and O. Kouchnarenko. "Verification of class liveness properties with Java modelling language." IET Software 2, no. 6 (2008): 500. http://dx.doi.org/10.1049/iet-sen:20080008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Liquori, Luigi, Furio Honsell, and Rekha Redamalla. "A Language for Verification and Manipulation of Web Documents." Electronic Notes in Theoretical Computer Science 157, no. 2 (May 2006): 67–78. http://dx.doi.org/10.1016/j.entcs.2005.12.046.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Tsai, Jeffrey J. P., A. P. Sistla, Avinash Sahay, and Ray Paul. "Incremental Verification of Architecture Specification Language for Real-Time Systems." International Journal of Software Engineering and Knowledge Engineering 08, no. 03 (September 1998): 347–60. http://dx.doi.org/10.1142/s0218194098000194.

Full text

Abstract:

The concept of software architecture has recently emerged as a new way to improve our ability to effectively construct large scale software systems. However, there is no formal architecture specification language available to model and analyze temporal properties of complex real-time systems. In this paper, an object-oriented logic-based architecture specification language for real-time systems is discussed. Representation of the temporal properties and timing constraints, and their integration with the language to model real-time concurrent systems is given. Architecture based specification languages enable the construction of large system architectures and provide a means of testing and validation. In general, checking the timing constraints of real-time systems is done by applying model checking to the constraint expressed as a formula in temporal logic. The complexity of such a formal method depends on the size of the representation of the system. It is possible that this size could increase exponentially when the system consists of several concurrently executing real-time processes. This means that the complexity of the algorithm will be exponential in the number of processes of the system and thus the size of the system becomes a limiting factor. Such a problem has been defined in the literature as "state explosion problem". We propose a method of incremental verification of architectural specifications for real-time systems. The method has a lower complexity in a sense that it does not work on the whole state space, but only on a subset of it that is relevant to the property to be verified.

APA, Harvard, Vancouver, ISO, and other styles

8

Zamani, Bahman, and Greg Butler. "Pattern Language Verification in Model Driven Design." Information Sciences 237 (July 2013): 343–55. http://dx.doi.org/10.1016/j.ins.2013.02.038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lorenzen, Florian, and Sebastian Erdweg. "Modular and automated type-soundness verification for language extensions." ACM SIGPLAN Notices 48, no. 9 (November 12, 2013): 331–42. http://dx.doi.org/10.1145/2544174.2500596.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Wang, Peng, Santiago Cuellar, and Adam Chlipala. "Compiler verification meets cross-language linking via data abstraction." ACM SIGPLAN Notices 49, no. 10 (December 31, 2014): 675–90. http://dx.doi.org/10.1145/2714064.2660201.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Zhang, Yuanrui, Frédéric Mallet, and Yixiang Chen. "A verification framework for spatio-temporal consistency language with CCSL as a specification language." Frontiers of Computer Science 14, no. 1 (November 13, 2018): 105–29. http://dx.doi.org/10.1007/s11704-018-7054-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

PIERRE, LAURENCE. "INDUCTION-ORIENTED VERIFICATION OF REPLICATED ARCHITECTURES DESCRIBED IN VHDL." Journal of Circuits, Systems and Computers 10, no. 03n04 (June 2000): 181–204. http://dx.doi.org/10.1142/s0218126600000159.

Full text

Abstract:

This paper is concerned with the application of theorem proving techniques to the formal proof of hardware. More precisely, we aim at providing a methodology for applying provers like Nqthm or Acl2 to the formal verification of parameterized replicated circuits. Nqthm (the Boyer–Moore theorem prover) and its successor Acl2 are induction-based systems; their formalisms are respectively a simplified Lisp-like language and Common Lisp. Hence, the circuits we consider must be given a purely functional representation. Moreover, our work puts the emphasis on the integration of formal proof techniques in CAD (Computer Aided Design) environments which support Hardware Description Languages in which replication is expressed by iteration. Therefore, we associate with the iterative statement of the VHDL language a functional semantics that guarantees an easy translation from VHDL to Nqthm/Acl2 while simplifying the subsequent inductive proofs. The approach has been successfully applied to one-dimensional as well as two-dimensional structures.

APA, Harvard, Vancouver, ISO, and other styles

13

Coblenz, Michael, Gauri Kambhatla, Paulette Koronkevich, Jenna L. Wise, Celeste Barnaby, Joshua Sunshine, Jonathan Aldrich, and Brad A. Myers. "PLIERS." ACM Transactions on Computer-Human Interaction 28, no. 4 (October 31, 2021): 1–53. http://dx.doi.org/10.1145/3452379.

Full text

Abstract:

Programming language design requires making many usability-related design decisions. However, existing HCI methods can be impractical to apply to programming languages: languages have high iteration costs, programmers require significant learning time, and user performance has high variance. To address these problems, we adapted both formative and summative HCI methods to make them more suitable for programming language design. We integrated these methods into a new process, PLIERS, for designing programming languages in a user-centered way. We assessed PLIERS by using it to design two new programming languages. Glacier extends Java to enable programmers to express immutability properties effectively and easily. Obsidian is a language for blockchains that includes verification of critical safety properties. Empirical studies showed that the PLIERS process resulted in languages that could be used effectively by many programmers and revealed additional opportunities for language improvement.

APA, Harvard, Vancouver, ISO, and other styles

14

Brown, A. D., and P. R. Thomas. "Implementation of a mask verification language and its compiler." IEE Proceedings E Computers and Digital Techniques 137, no. 3 (1990): 207. http://dx.doi.org/10.1049/ip-e.1990.0026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Herdt, Vladimir, Hoang M. Le, Daniel Grobe, and Rolf Drechsler. "Verifying SystemC Using Intermediate Verification Language and Stateful Symbolic Simulation." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 38, no. 7 (July 2019): 1359–72. http://dx.doi.org/10.1109/tcad.2018.2846638.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Ruan, J., W. van der Hoek, and M. Wooldridge. "Verification of Games in the Game Description Language." Journal of Logic and Computation 19, no. 6 (August 5, 2009): 1127–56. http://dx.doi.org/10.1093/logcom/exp039.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Barkovich, Aliaksandr A. "Russian-Belarusian Cross-Lingual Interference and Trasianka: Computer-Mediated Verification and Scientific Reflection." Vestnik Tomskogo gosudarstvennogo universiteta. Filologiya, no. 69 (February 1, 2021): 5–28. http://dx.doi.org/10.17223/19986645/69/1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Misra, Abhinav, and John H. L. Hansen. "Modelling and compensation for language mismatch in speaker verification." Speech Communication 96 (February 2018): 58–66. http://dx.doi.org/10.1016/j.specom.2017.09.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Rouas, Jean-Luc, Isabel Trancoso, Céu Viana, and Mónica Abreu. "Language and variety verification on broadcast news for Portuguese." Speech Communication 50, no. 11-12 (November 2008): 965–79. http://dx.doi.org/10.1016/j.specom.2008.05.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Delzanno, G. "An Assertional Language for the Verification of Systems Parametric in Several Dimensions." Electronic Notes in Theoretical Computer Science 50, no. 4 (August 2001): 371–85. http://dx.doi.org/10.1016/s1571-0661(04)00189-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Gotsman, Alexey, Fabio Massacci, and Marco Pistore. "Towards an Independent Semantics and Verification Technology for the HLPSL Specification Language." Electronic Notes in Theoretical Computer Science 135, no. 1 (July 2005): 59–77. http://dx.doi.org/10.1016/j.entcs.2005.06.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

ZHANG, PENGCHENG, HENRY MUCCINI, YUELONG ZHU, and BIXIN LI. "MODEL AND VERIFICATION OF WS-CDL BASED ON UML DIAGRAMS." International Journal of Software Engineering and Knowledge Engineering 20, no. 08 (December 2010): 1119–49. http://dx.doi.org/10.1142/s0218194010005092.

Full text

Abstract:

The Web Services Choreography Description Language (WS-CDL) is a specification developed by the W3C and can be viewed as a blueprint for the development of end-point services. Consequently, it is worth providing a systematic approach for its modeling, analysis and verification. The Unified Modeling Language (UML) is an industry standard for modeling. Applying UML to model WS-CDL is obviously a promising solution to bring together academics and practitioners through a unique standard language. In this paper, we propose to use different UML diagrams to model WS-CDL. UML Component Diagram is used to model the underlying structure of WS-CDL. UML Sequence Diagram is utilized to model the activities in WS-CDL. UML State Machine Diagram is utilized to model the behaviors of each role participating in a WS-CDL specification. We then enrich the UML State Machine Diagram with data by the use of UML Class Diagram. Given the UML specification of WS-CDL, we then provide a systematic way of formally analyzing and verifying WS-CDL against desired properties. Some experiments show that our approach can verify structural, behavioral and data properties in a middle-scale data-enriched WS-CDL specification.

APA, Harvard, Vancouver, ISO, and other styles

23

Hinsen, Konrad. "Verifiability in computer-aided research: the role of digital scientific notations at the human-computer interface." PeerJ Computer Science 4 (July 23, 2018): e158. http://dx.doi.org/10.7717/peerj-cs.158.

Full text

Abstract:

Most of today’s scientific research relies on computers and software for processing scientific information. Examples of such computer-aided research are the analysis of experimental data or the simulation of phenomena based on theoretical models. With the rapid increase of computational power, scientific software has integrated more and more complex scientific knowledge in a black-box fashion. As a consequence, its users do not know, and do not even have a chance of finding out, which assumptions and approximations their computations are based on. This black-box nature of scientific software has made the verification of much computer-aided research close to impossible. The present work starts with an analysis of this situation from the point of view of human-computer interaction in scientific research. It identifies the key role of digital scientific notations at the human-computer interface, reviews the most popular ones in use today, and describes a proof-of-concept implementation of Leibniz, a language designed as a verifiable digital scientific notation for models formulated as mathematical equations.

APA, Harvard, Vancouver, ISO, and other styles

24

Alekhin, V. A. "Designing Electronic Systems Using SystemC and SystemC–AMS." Russian Technological Journal 8, no. 4 (August 6, 2020): 79–95. http://dx.doi.org/10.32362/2500-316x-2020-8-4-79-95.

Full text

Abstract:

Current trends in the design of electronic systems is the use of embedded systems based on systems on a chip (System-on-Chip (SoC)) or (VLSI SoC). The paper discusses the design features of electronic systems on a chip using the SystemC design and verification language. For the joint design and simulation of digital systems hardware and software, seven modeling levels are presented and discussed: executable specification, disabled functional model, temporary functional model, transaction-level model, behavioral hardware model, accurate hardware model, register transfer model. The SystemC design methodology with functional verification is presented, which reduces development time.The architecture of the SystemC language and its main components are shown. The expansion of SystemC–AMS for analog and mixed analog-digital signals and its use cases in the design of electronic systems are considered. Computing models are discussed: temporary data stream (TDF), linear signal stream (LSF) and electric linear networks (ELN). The architecture of the SystemC–AMS language standard is shown and examples of its application are given. It is shown that the design languages SystemC and SystemC–AMS are widely used by leading developers of computer-aided design systems for electronic devices.

APA, Harvard, Vancouver, ISO, and other styles

25

Ferlin, Antoine, Virginie Wiels, and Philippe Bon. "Statistical Automaton for Verifying Temporal Properties and Computing Information on Traces." International Journal of Computers Communications & Control 11, no. 5 (August 31, 2016): 645. http://dx.doi.org/10.15837/ijccc.2016.5.2148.

Full text

Abstract:

Verification is decisive for embedded software. The goal of this work is to verify temporal properties on industrial applications, with the help of formal dynamic analysis. The approach presented in this paper is composed of three steps: formalization of temporal properties using an adequate language, generation of execution traces from a given property and verification of this property on execution traces. This paper focuses on the verification step. Use of a new kind of Büchi automaton has been proposed to provide an efficient verification taking into account the industrial needs and constraints. A prototype has been developed and used to carry out experiments on different anonymous real industrial applications.

APA, Harvard, Vancouver, ISO, and other styles

26

POERNOMO, IMAN, HEINZ SCHMIDT, and JANE JAYAPUTERA. "VERIFICATION AND PREDICTION OF TIMED PROBABILISTIC PROPERTIES OVER THE DMTF CIM." International Journal of Cooperative Information Systems 15, no. 04 (December 2006): 633–58. http://dx.doi.org/10.1142/s0218843006001517.

Full text

Abstract:

Understanding nonfunctional aspects of system behavior is an essential component of practical software development and maintenance. Many nonfunctional system properties, such as reliability and availability, involve time and probabilities. In this paper, we present a framework for runtime verification and prediction of timed and probabilistic nonfunctional properties of component-based architectures, built using the Meta-Object Facility and the Distributed Management Task Force's Common Information Model (CIM) standard. We describe a Microsoft .NET-based implementation of our framework. We define a language for describing timed probabilistic behavior based on Probabilistic Computational Tree Logic (PCTL). We provide a formal semantics for this language in terms of observed application execution traces. The semantics is interesting in that it permits checking of required timing behavior both over the overall average of traces and also over local "trends" in traces. The latter aspect of the semantics is achieved by incorporating exponential smoothing prediction techniques into the truth function for statements of our language. The semantics is generic over the aspects of an application that are represented by states and state transitions. This enables the language to be used to describe a wide range of nonfunctional properties for runtime verification and prediction purposes. We explain how statements of our language are used to define precise contracts for system monitoring, through relating the semantics to an extended CIM monitoring infrastructure.

APA, Harvard, Vancouver, ISO, and other styles

27

BOUDIAF, NOURA, FARID MOKHATI, and MOURAD BADRI. "SUPPORTING FORMAL VERIFICATION OF DIMA MULTI-AGENTS MODELS: TOWARDS A FRAMEWORK BASED ON MAUDE MODEL CHECKING." International Journal of Software Engineering and Knowledge Engineering 18, no. 07 (November 2008): 853–75. http://dx.doi.org/10.1142/s021819400800391x.

Full text

Abstract:

Model Checking based verification techniques represent an important issue in the field of concurrent systems quality assurance. The lack of formal semantics in the existing formalisms describing multi-agents models combined with multi-agents systems complexity are sources of several problems during their development process. The Maude language, based on rewriting logic, offers a rich notation supporting formal specification and implementation of concurrent systems. In addition to its modeling capacity, the Maude environment integrates a Model Checker based on Linear Temporal Logic (LTL) for distributed systems verification. In this paper, we present a formal and generic framework (DIMA-Maude) supporting formal description and verification of DIMA multi-agents models.

APA, Harvard, Vancouver, ISO, and other styles

28

Mauw, S., and G. J. Veltink. "A Process Specification Formalism1." Fundamenta Informaticae 13, no. 2 (April 1, 1990): 85–139. http://dx.doi.org/10.3233/fi-1990-13202.

Full text

Abstract:

Traditional methods for programming sequential machines are inadequate for specifying parallel systems. Because debugging of parallel programs is hard, due to e.g. non-deterministic execution, verification of program correctness becomes an even more important issue. The Algebra of Communicating Processes (ACP) is a formal theory which emphasizes verification and can be applied to a large domain of problems ranging from electronic circuits to CAM architectures. The manual verification of specifications of small size has already been achieved, but this cannot easily be extended to the verification of larger industrially relevant systems. To deal with this problem we need computer tools to help with the specification, simulation, verification and implementation. The first requirement for building such a set of tools is a specification language. In this paper we introduce PSFd (Process Specification Formalism – draft) which can be used to formally express processes in ACP. In order to meet the modern requirements of software engineering, like reusability of software, PSFd supports the modular construction of specifications and parameterization of modules. To be able to deal with the notion of data, ASF (Algebraic Specification Formalism) is embedded in our formalism. As semantics for PSFd a combination of initial algebra semantics and operational semantics for concurrent processes is used. A comparison with programming languages and other formal description techniques for the specification of concurrent systems is included.

APA, Harvard, Vancouver, ISO, and other styles

29

COOKE, DANIEL E. "POSSIBLE EFFECTS OF THE NEXT GENERATION PROGRAMMING LANGUAGE ON THE SOFTWARE PROCESS MODEL." International Journal of Software Engineering and Knowledge Engineering 03, no. 03 (September 1993): 383–99. http://dx.doi.org/10.1142/s0218194093000185.

Full text

Abstract:

This paper reviews the impact that the next generation programming environment may have on the software process model. In doing so it informally defines the concept of a next generation language and seriously considers the concerns of software development, validation, verification, and evolution within the context of a future abstraction.

APA, Harvard, Vancouver, ISO, and other styles

30

Szpyrka, Marcin, Michal Wypych, Jerzy Biernacki, and Lukasz Podolski. "Discrete-Time Systems Modeling and Verification With Alvis Language and Tools." IEEE Access 6 (2018): 78766–79. http://dx.doi.org/10.1109/access.2018.2885249.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Muñoz-Quijada, Maria, Luis Sanz, and Hipolito Guzman-Miranda. "SW-VHDL Co-Verification Environment Using Open Source Tools." Electronics 9, no. 12 (December 10, 2020): 2104. http://dx.doi.org/10.3390/electronics9122104.

Full text

Abstract:

The verification of complex digital designs often involves the use of expensive simulators. The present paper proposes an approach to verify a specific family of complex hardware/software systems, whose hardware part, running on an FPGA, communicates with a software counterpart executed on an external processor, such as a user/operator software running on an external PC. The hardware is described in VHDL and the software may be described in any computer language that can be interpreted or compiled into a (Linux) executable file. The presented approach uses open source tools, avoiding expensive license costs and usage restrictions.

APA, Harvard, Vancouver, ISO, and other styles

32

Perez, Joaquin, Jaime Jimenez, Asier Rabanal, Armando Astarloa, and Jesus Lazaro. "FTL-CFree: A Fuzzy Real-Time Language for Runtime Verification." IEEE Transactions on Industrial Informatics 10, no. 3 (August 2014): 1670–83. http://dx.doi.org/10.1109/tii.2014.2307531.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

ABDULLA, PAROSH AZIZ, GIORGIO DELZANNO, and AHMED REZINE. "AUTOMATIC VERIFICATION OF DIRECTORY-BASED CONSISTENCY PROTOCOLS WITH GRAPH CONSTRAINTS." International Journal of Foundations of Computer Science 22, no. 04 (June 2011): 761–82. http://dx.doi.org/10.1142/s0129054111008416.

Full text

Abstract:

We propose a symbolic verification method for directory-based consistency protocols working for an arbitrary number of controlled resources and competing processes. We use a graph-based language to specify in a uniform way both client/server interaction schemes and manipulation of directories that contain the access rights of individual clients. Graph transformations model the dynamics of a given protocol. Universally quantified conditions defined on the labels of edges incident to a given node are used to model inspection of directories, invalidation loops and integrity conditions. Our verification procedure computes an approximated backward reachability analysis by using a symbolic representation of sets of configurations. Termination is ensured by using the theory of well-quasi orderings.

APA, Harvard, Vancouver, ISO, and other styles

34

Ji, Shunhui, Liming Hu, Yihan Cao, Pengcheng Zhang, and Jerry Gao. "Verifiable Model Construction for Business Processes." International Journal of Software Engineering and Knowledge Engineering 31, no. 07 (July 2021): 1017–42. http://dx.doi.org/10.1142/s0218194021500315.

Full text

Abstract:

Business process specified in Business Process Execution Language (BPEL), which integrates existing services to develop composite service for offering more complicated function, is error-prone. Verification and testing are necessary to ensure the correctness of business processes. SPIN, for which the input language is PROcess MEta-LAnguage (Promela), is one of the most popular tools for detecting software defects and can be used both in verification and testing. In this paper, an automatic approach is proposed to construct the verifiable model for BPEL-based business process with Promela language. Business process is translated to an intermediate two-level representation, in which eXtended Control Flow Graph (XCFG) describes the behavior of BPEL process in the first level and Web Service Description Models (WSDM) depict the interface information of composite service and partner services in the second level. With XCFG of BPEL process, XCFGs for partner services are generated to describe their behavior. Promela model is constructed by defining data types based on WSDM and defining channels, variables and processes based on XCFGs. The constructed Promela model is closed, containing not only the BPEL process but also its execution environment. Case study shows that the proposed approach is effective.

APA, Harvard, Vancouver, ISO, and other styles

35

HE, HONGYUE, ZHIXUE WANG, QINGCHAO DONG, WEIZHONG ZHANG, and WEIXING ZHU. "ONTOLOGY-BASED SEMANTIC VERIFICATION FOR UML BEHAVIORAL MODELS." International Journal of Software Engineering and Knowledge Engineering 23, no. 02 (March 2013): 117–45. http://dx.doi.org/10.1142/s0218194013500010.

Full text

Abstract:

UML is now popularly applied as a requirements modeling language for software system analysis and design, and the dynamic behaviors of system are described in UML behavioral model. As the UML model suffers from lack of well-defined formal semantics, it is difficult to formally analyze and verify the behavioral model. The paper presents a method of UML behavioral model verification based on Description Logic system and its formal inference. The semantics of UML behavioral models is divided into static semantics and dynamic semantics, which are formally specified in OWL DL ontology and DL-Safe rules. To check the consistency of the behavioral models, the algorithms are provided for transforming UML behavioral models into OWL DL ontology, and hence model consistency can be verified through formal reasoning with a DL supporting reasoner Pellet. A case study is provided to demonstrate applicability of the method.

APA, Harvard, Vancouver, ISO, and other styles

36

Kowalczuk, Zdzisław, and Jakub Wszołek. "Analysis of Economical Lighting of Highways in the Environment of SMOL Language." Metrology and Measurement Systems 24, no. 3 (September 1, 2017): 473–88. http://dx.doi.org/10.1515/mms-2017-0041.

Full text

Abstract:

AbstractThe paper puts forward and implements a method of designing and creating a modelling simulation environment for extensive and complete analysis of economical lighting on highways. From a general design viewpoint, the proposed solution explores the concept of a network description language (SMOL), which has been designed to describe the necessary network functions, mechanisms, and devices for the purpose of their computer simulation and verification. The presented results of the performed research confirm the usability of intelligent lighting on highways, both in the sense of the design concept and in the aspect of saving energy.

APA, Harvard, Vancouver, ISO, and other styles

37

PENCZEK, WOJCIECH. "TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION." International Journal of Foundations of Computer Science 04, no. 01 (March 1993): 31–67. http://dx.doi.org/10.1142/s0129054193000043.

Full text

Abstract:

We investigate an extension of CTL (Computation Tree Logic) by past modalities, called CTL P, interpreted over Mazurkiewicz’s trace systems. The logic is powerful enough to express most of the partial order properties of distributed systems like serializability of database transactions, snapshots, parallel execution of program segments, or inevitability under concurrency fairness assumption. We show that the model checking problem for the logic is NP-hard, even if past modalities cannot be nested. Then, we give a one exponential time model checking algorithm for the logic without nested past modalities. We show that all the interesting partial order properties can be model checked using our algorithm. Next, we show that is is possible to extend the model checking algorithm to cover the whole language and its extension to [Formula: see text]. Finally, we prove that the logic is undecidable and we discuss consequences of our results on using propositional versions of partial order temporal logics to synthesis of concurrent systems from their specifications.

APA, Harvard, Vancouver, ISO, and other styles

38

Banerjee, Debanshu, Bitanu Chatterjee, Pratik Bhowal, Trinav Bhattacharyya, Samir Malakar, and Ram Sarkar. "A new wrapper feature selection method for language-invariant offline signature verification." Expert Systems with Applications 186 (December 2021): 115756. http://dx.doi.org/10.1016/j.eswa.2021.115756.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

POPIC, S., N. TESLIC, and M. Z. BJELICA. "Simple Framework for Efficient Development of the Functional Requirement Verification-specific Language." Advances in Electrical and Computer Engineering 21, no. 3 (2021): 11–20. http://dx.doi.org/10.4316/aece.2021.03002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Muaffaq, Ahmad, and Napis Dj. "FOREIGN LANGUAGE BEHAVIOR OF ISLAMIC BOARDING SCHOOL STUDENTS IN WEST SULAWESI." Al-Qalam 27, no. 1 (July 21, 2021): 51. http://dx.doi.org/10.31969/alq.v27i1.935.

Full text

Abstract:

<div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p><span>Students of Islamic Boarding Schools in West Sulawesi come from various ethnicities. They relatively concern about their pride, loyalty, and awareness of foreign language norms as an essential part of the Islamic Boarding School curriculum. It also has an impact on the quality of its acquisition. This study aims to describe the students' behavioral patterns in using foreign languages and their factors. The data was excavated from informants on five Islamic Boarding Schools integrated with stratified random sampling models. Data collection techniques were observations, surveys, and interviews. The obtained data were carefully and critically analyzed based on data reduction, presentation, and verification methods. The results showed that the foreign languages in Islamic Boarding Schools at West Sulawesi are generally used passively because the students’ activities highly focus on improving students’ ability in reading. The emphasis is also on the ability to understand Arabic text. Regarding Islamic Boarding School that applies language development for reading and active communication, sociologically, students use foreign languages only in a small number of linguistic situations and in specific domains, namely education. Culturally, foreign language behavior breeds symptoms of multilingualism, bilingualism, code-switching and code-mixing, monolingualism, and interference in all linguistic situations. It is due to the responsibility, loyalty, and motivation of foreign affairs that are still lacking and the insufficient quality of teachers, environmental conditions, and curriculum content.</span></p></div></div></div>

APA, Harvard, Vancouver, ISO, and other styles

41

Nepomniaschy, Valery A., Evgeniy V. Bodin, and Sergey O. Veretnov. "The analysis and verification of SDL-specifications of distributed systems using Dynamic-REAL Language." Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitel'naya tekhnika i informatika, no. 53 (December 1, 2020): 118–26. http://dx.doi.org/10.17223/19988605/53/12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

AMMAR, MAAN. "PROGRESS IN VERIFICATION OF SKILLFULLY SIMULATED HANDWRITTEN SIGNATURES." International Journal of Pattern Recognition and Artificial Intelligence 05, no. 01n02 (June 1991): 337–51. http://dx.doi.org/10.1142/s0218001491000193.

Full text

Abstract:

This paper compares the performances of parametric and reference pattern based features (RPBFs) in the verification of skillfully simulated handwritten signatures. The comparison shows that RPBFs significantly improve results and give about 90% correct verification using only shape features. The performance of the used shape features is independent of the signature shape, language and position in the document. The careful analysis of the experimental results of using RPBFs in verification has led to the conclusion that two-dimensional RPBFs will give much better performance.

APA, Harvard, Vancouver, ISO, and other styles

43

Giero, Mariusz. "Propositional Linear Temporal Logic with Initial Validity Semantics." Formalized Mathematics 23, no. 4 (December 1, 2015): 379–86. http://dx.doi.org/10.1515/forma-2015-0030.

Full text

Abstract:

Summary In the article [10] a formal system for Propositional Linear Temporal Logic (in short LTLB) with normal semantics is introduced. The language of this logic consists of “until” operator in a very strict version. The very strict “until” operator enables to express all other temporal operators. In this article we construct a formal system for LTLB with the initial semantics [12]. Initial semantics means that we define the validity of the formula in a model as satisfaction in the initial state of model while normal semantics means that we define the validity as satisfaction in all states of model. We prove the Deduction Theorem, and the soundness and completeness of the introduced formal system. We also prove some theorems to compare both formal systems, i.e., the one introduced in the article [10] and the one introduced in this article. Formal systems for temporal logics are applied in the verification of computer programs. In order to carry out the verification one has to derive an appropriate formula within a selected formal system. The formal systems introduced in [10] and in this article can be used to carry out such verifications in Mizar [4].

APA, Harvard, Vancouver, ISO, and other styles

44

Ranatunga, Sandaruwan Prabath Kumara. "Finding Efficient Linguistic Feature Set for Authorship Verification." Journal of Computer Science 1, no. 1 (October 7, 2013): 35–43. http://dx.doi.org/10.31357/jcs.v1i1.1616.

Full text

Abstract:

Authorship verification rely on identification of a given document is written by a particular author or not. Internally analyzing the document itself with respect to the variations in writing style of the author and identification of the author’s own idiolect is the main context of the authorship verification. Mainly, the detection performance depends on the used feature set for clustering the document. Linguistic features and stylistic features have been utilized for author identification according to the writing style of a particular author. Disclose the shallow changes of the author’s writing style is the major problem which should be addressed in the domain of authorship verification. It motivates the computer science researchers to do research on authorship verification in the field of computer forensics and this research also focuses this problem. The contributions from the research are two folded: Former is introducing a new feature extracting method with Natural Language Processing (NLP) and later is propose a new more efficient linguistic feature set for verification of author of the given document. Experiments on a corpus composed of freely downloadable genuine 19th century English Books and Self Organizing Maps has been used as the classifier to cluster the documents. Proper word segmentation also introduced in this work and it helps to demonstrate that the proposed strategy can produced promising results. Finally, it is realized that more accurate classification is generated by the proposed strategy with extracted linguistic feature set.

APA, Harvard, Vancouver, ISO, and other styles

45

STUIT, MARCO, and NICK B. SZIRBIK. "TOWARDS AGENT-BASED MODELING AND VERIFICATION OF COLLABORATIVE BUSINESS PROCESSES: AN APPROACH CENTERED ON INTERACTIONS AND BEHAVIORS." International Journal of Cooperative Information Systems 18, no. 03n04 (September 2009): 423–79. http://dx.doi.org/10.1142/s0218843009002063.

Full text

Abstract:

This paper presents the process-oriented aspects of a formal and visual agent-based business process modeling language. The language is of use for (networks of) organizations that elect or envisage multi-agent systems for the support of collaborative business processes. The paper argues that the design of a collaborative business process should start with a proper understanding of the work practice of the agents in the business domain under consideration. The language introduces a novel diagram to represent the wide range of (cross-enterprise) business interactions as a hierarchy of role-based interactions (including their ordering relations) in a tree structure. The behaviors owned by the agents playing the roles in the tree are specified in separate process diagrams. A collaborative business process studied in the context of a case study at a Dutch gas transport company is used to exemplify the modeling approach. Explicit (agent-based) process models can and should be verified using formal methods. In the business process community, design-time verification of a process design is considered vital in order to ensure the correctness and termination of a collaborative business process. The proposed modeling approach is enhanced with a design-time verification method. The direction taken in this research is to combine the interaction tree and the associated agent behaviors into a verifiable hierarchical colored Petri net in order to take advantage of its well-defined (execution) semantics and proven (computerized) verification techniques. The verification method presented in this paper consists of three steps: (1) the translation of the agent-based process design to a hierarchical colored Petri net, (2) the identification of process design errors, and (3) the correction and rollback of process design errors to the agent-based model. The translation technique has been implemented in a software tool that outputs the hierarchical colored Petri net in a format that can be loaded in the widely used CPN Tools software package. Verification results are discussed for the case study model.

APA, Harvard, Vancouver, ISO, and other styles

46

Seco, João, Ricardo Silva, and Margarida Piriquito. "Component J: A component-based programming language with dynamic reconfiguration." Computer Science and Information Systems 5, no. 2 (2008): 63–86. http://dx.doi.org/10.2298/csis0802063s.

Full text

Abstract:

This paper describes an evolution of the ComponentJ programming language, a component-based Java-like programming language where composition is the chosen structuring mechanism. ComponentJ constructs allow for the high-level specification of component structures, which are the basis for the definition of compound objects. In this paper we present a new language design for ComponentJ which is more flexible and also allows the dynamic reconfiguration of objects. The manipulation of components and composition operations at the programming language level allows for the compile time verification, by a type system, of safety structural properties of ComponentJ programs. This work is based on earlier fundamental results where the main concepts are presented and justified in the form of a core component calculus. .

APA, Harvard, Vancouver, ISO, and other styles

47

Marcialis, Gian Luca, Fabio Roli, and Daniele Muntoni. "Group-specific face verification using soft biometrics." Journal of Visual Languages & Computing 20, no. 2 (April 2009): 101–9. http://dx.doi.org/10.1016/j.jvlc.2009.01.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Morales, Lorenzo, and Francis F. Li. "A new verification of the speech transmission index for the English language." Speech Communication 105 (December 2018): 1–11. http://dx.doi.org/10.1016/j.specom.2018.10.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

DELZANNO, GIORGIO. "Constraint-based automatic verification of abstract models of multithreaded programs." Theory and Practice of Logic Programming 7, no. 1-2 (January 2007): 67–91. http://dx.doi.org/10.1017/s1471068406002821.

Full text

Abstract:

AbstractWe present a technique for the automated verification of abstract models of multithreaded programs providing fresh name generation, name mobility, and unbounded control. As high level specification language we adopt here an extension of communication finite-state machines with local variables ranging over an infinite name domain, called TDL programs. Communication machines have been proved very effective for representing communication protocols as well as for representing abstractions of multithreaded software. The verification method that we propose is based on the encoding of TDL programs into a low level language based on multiset rewriting and constraints that can be viewed as an extension of Petri Nets. By means of this encoding, the symbolic verification procedure developed for the low level language in our previous work can now be applied to TDL programs. Furthermore, the encoding allows us to isolate a decidable class of verification problems for TDL programs that still provide fresh name generation, name mobility, and unbounded control. Our syntactic restrictions are in fact defined on the internal structure of threads: In order to obtain a complete and terminating method, threads are only allowed to have at most one local variable (ranging over an infinite domain of names).

APA, Harvard, Vancouver, ISO, and other styles

50

Lamel, L. F., and J. L. Gauvain. "Speaker verification over the telephone." Speech Communication 31, no. 2-3 (June 2000): 141–54. http://dx.doi.org/10.1016/s0167-6393(99)00075-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!