Segui questo link per vedere altri tipi di pubblicazioni sul tema: Programming language semantics.

Articoli di riviste sul tema "Programming language semantics"

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Vedi i top-50 articoli di riviste per l'attività di ricerca sul tema "Programming language semantics".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Vedi gli articoli di riviste di molte aree scientifiche e compila una bibliografia corretta.

1

Schmidt, David A. "Programming language semantics." ACM Computing Surveys 28, no. 1 (March 1996): 265–67. http://dx.doi.org/10.1145/234313.234419.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Riecke, Jon G. "Programming language semantics." ACM SIGPLAN Notices 32, no. 1 (January 1997): 106–9. http://dx.doi.org/10.1145/251595.251613.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Steingartner, William. "On some innovations in teaching the formal semantics using software tools." Open Computer Science 11, no. 1 (December 17, 2020): 2–11. http://dx.doi.org/10.1515/comp-2020-0130.

Testo completo
Abstract (sommario):
AbstractIn this work we discuss the motivation for innovations and need of a teaching tool for the visualization of the natural semantics method of imperative programming languages. We present the rôle of the teaching software, its design, development and use in the teaching process. Our software module is able to visualize the natural semantics evaluation of programs. It serves as a compiler with environment that can visually interpret simple programming language Jane statements and to depict them into a derivation tree that represents the semantic method of natural semantics. A formal defini
Gli stili APA, Harvard, Vancouver, ISO e altri
4

MLNAŘÍK, HYNEK. "SEMANTICS OF QUANTUM PROGRAMMING LANGUAGE LANQ." International Journal of Quantum Information 06, supp01 (July 2008): 733–38. http://dx.doi.org/10.1142/s0219749908004031.

Testo completo
Abstract (sommario):
We show a memory model of an imperative concurrent quantum programming language LanQ. The memory model is used to specify the shape of semantical structure upon which the language operational semantics is defined. We also outline the language abilities in the area of formal verification on an example implementation of teleportation protocol.
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Abadi, Martín. "Secrecy in Programming-Language Semantics." Electronic Notes in Theoretical Computer Science 20 (1999): 80–94. http://dx.doi.org/10.1016/s1571-0661(04)80068-9.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

COSTANTINI, STEFANIA. "SEMANTICS OF A METALOGIC PROGRAMMING LANGUAGE." International Journal of Foundations of Computer Science 01, no. 03 (September 1990): 233–47. http://dx.doi.org/10.1142/s0129054190000175.

Testo completo
Abstract (sommario):
This paper presents the declarative and procedural semantics of Reflective Prolog, a new logic language able to represent metaknowledge and use it in the proof process via an extended resolution procedure including forms of implicit reflection. The declarative semantics of a Reflective Prolog definite program is provided in terms of the Least Reflective Herbrand Model of the program, characterized by means of a suitable mapping. The extended resolution is then shown to be sound and complete with respect to the Least Reflective Herband Model.
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Steingartner, William, and Valerie Novitzká. "Categorical model of structural operational semantics for imperative language." Journal of information and organizational sciences 40, no. 2 (December 9, 2016): 203–19. http://dx.doi.org/10.31341/jios.40.2.3.

Testo completo
Abstract (sommario):
Definition of programming languages consists of the formal definition of syntax and semantics. One of the most popular semantic methods used in various stages of software engineering is structural operational semantics. It describes program behavior in the form of state changes after execution of elementary steps of program. This feature makes structural operational semantics useful for implementation of programming languages and also for verification purposes. In our paper we present a new approach to structural operational semantics. We model behavior of programs in category of states, where
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Bruce, Kim B. "A paradigmatic object-oriented programming language: Design, static typing and semantics." Journal of Functional Programming 4, no. 2 (April 1994): 127–206. http://dx.doi.org/10.1017/s0956796800001039.

Testo completo
Abstract (sommario):
AbstractTo illuminate the fundamental concepts involved in object-oriented programming languages, we describe the design of TOOPL, a paradigmatic, statically-typed, functional, object-oriented programming language which supports classes, objects, methods, hidden instance variables, subtypes and inheritance.It has proven to be quite difficult to design such a language which has a secure type system. A particular problem with statically type checking object-oriented languages is designing typechecking rules which ensure that methods provided in a superclass will continue to be type correct when
Gli stili APA, Harvard, Vancouver, ISO e altri
9

GUO, MINYI. "DENOTATIONAL SEMANTICS OF AN HPF-LIKE DATA-PARALLEL LANGUAGE MODEL." Parallel Processing Letters 11, no. 02n03 (June 2001): 363–74. http://dx.doi.org/10.1142/s0129626401000658.

Testo completo
Abstract (sommario):
It is important for programmers to understand the semantics of a programming language. However, little work has been done about the semantic descriptions of HPF-like data-parallel languages. In this paper, we first define a simple language [Formula: see text], which includes the principal facilities of a data-parallel language such as HPF. Then we present a denotational semantic model of [Formula: see text]. It is useful for understanding the components of an HPF-like language, such as data alignment and distribution directives, forall data-parallel statements.
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Domanov, Oleg. "ON TYPE-THEORETICAL FORMALIZATION OF SITUATION SEMANTICS." Respublica literaria, RL. 2021. vol. 2. no. 3 (September 15, 2021): 32–41. http://dx.doi.org/10.47850/rl.2021.2.3.32-41.

Testo completo
Abstract (sommario):
Situation semantics is an effective instrument for analysing semantical aspects of natural languages with explicit dependence on contexts, like referential opacity of belief contexts etc. Making use of type-theoretical approaches not only makes its formalism more practical in many ways, but also facilitates its migration to computer systems, specifically, the formalization in functional programming languages. The article deals with a prototype of the type theoretical language of situation semantics, implemented on the basis of the language Racket. It decribes principal approaches, methods of s
Gli stili APA, Harvard, Vancouver, ISO e altri
11

Hannan, John. "Extended natural semantics." Journal of Functional Programming 3, no. 2 (April 1993): 123–52. http://dx.doi.org/10.1017/s0956796800000666.

Testo completo
Abstract (sommario):
AbstractWe extend the definition of natural semantics to include simply typed λ-terms, instead of first-order terms, for representing programs, and to include inference rules for the introduction and discharge of hypotheses and eigenvariables. This extension, which we call extended natural semantics, affords a higher-level notion of abstract syntax for representing programs and suitable mechanisms for manipulating this syntax. We present several examples of semantic specifications for a simple functional programming language and demonstrate how we achieve simple and elegant manipulations of bo
Gli stili APA, Harvard, Vancouver, ISO e altri
12

SELINGER, PETER. "Towards a quantum programming language." Mathematical Structures in Computer Science 14, no. 4 (August 2004): 527–86. http://dx.doi.org/10.1017/s0960129504004256.

Testo completo
Abstract (sommario):
We propose the design of a programming language for quantum computing. Traditionally, quantum algorithms are frequently expressed at the hardware level, for instance in terms of the quantum circuit model or quantum Turing machines. These approaches do not encourage structured programming or abstractions such as data types. In this paper, we describe the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types. The language is functional in nature, statically typed, free of run-time errors, and has an i
Gli stili APA, Harvard, Vancouver, ISO e altri
13

HARRISON, AMELIA, and VLADIMIR LIFSCHITZ. "Relating Two Dialects of Answer Set Programming." Theory and Practice of Logic Programming 19, no. 5-6 (September 2019): 1006–20. http://dx.doi.org/10.1017/s1471068419000322.

Testo completo
Abstract (sommario):
AbstractThe input language of the answer set solver clingo is based on the definition of a stable model proposed by Paolo Ferraris. The semantics of the ASP-Core language, developed by the ASP Standardization Working Group, uses the approach to stable models due to Wolfgang Faber, Nicola Leone, and Gerald Pfeifer. The two languages are based on different versions of the stable model semantics, and the ASP-Core document requires, “for the sake of an uncontroversial semantics,” that programs avoid the use of recursion through aggregates. In this paper we prove that the absence of recursion throu
Gli stili APA, Harvard, Vancouver, ISO e altri
14

WU, Heng-Yang. "The Semantics of Imperative Fuzzy Programming Language." Chinese Journal of Computers 36, no. 4 (March 13, 2014): 862–69. http://dx.doi.org/10.3724/sp.j.1016.2013.00862.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
15

Ghica, Dan R., and Khulood Alyahya. "On the Learnability of Programming Language Semantics." Electronic Proceedings in Theoretical Computer Science 261 (November 29, 2017): 57–75. http://dx.doi.org/10.4204/eptcs.261.7.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
16

Zamulin, A. V. "Algebraic Semantics of an Imperative Programming Language." Programming and Computer Software 29, no. 6 (November 2003): 328–37. http://dx.doi.org/10.1023/b:pacs.0000004133.80483.66.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
17

Sulema, Y. S., and V. V. Glinskii. "Semantics and pragmatics of programming language ASAMPL." PROBLEMS IN PROGRAMMING, no. 1 (January 2020): 074–83. http://dx.doi.org/10.15407/pp2020.01.074.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
18

Laird, J. "Game semantics for a polymorphic programming language." Journal of the ACM 60, no. 4 (August 2013): 1–27. http://dx.doi.org/10.1145/2508028.2505986.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
19

Tchier, F. "Demonic semantics: using monotypes and residuals." International Journal of Mathematics and Mathematical Sciences 2004, no. 3 (2004): 135–60. http://dx.doi.org/10.1155/s016117120420415x.

Testo completo
Abstract (sommario):
Relations and relational operators can be used to define the semantics of programming languages. The operations∨and∘serve to giveangelic semanticsby defining a program to go right when there is a possibility to go right. On the other hand, the demonic operations⊔and□do the opposite: if there is a possibility to go wrong, a program whose semantics is given by these operators will go wrong; it is thedemonic semantics. This type of semantics is known at least since Dijkstra's introduction of the language of guarded commands. Recently, there has been a growing interest in demonic relational semant
Gli stili APA, Harvard, Vancouver, ISO e altri
20

ABRAMOV, SERGEI, and ROBERT GLÜCK. "FROM STANDARD TO NON-STANDARD SEMANTICS BY SEMANTICS MODIFIERS." International Journal of Foundations of Computer Science 12, no. 02 (April 2001): 171–211. http://dx.doi.org/10.1142/s0129054101000448.

Testo completo
Abstract (sommario):
An approach for systematically modifying the semantics of programming languages by semantics modifiers is described. Semantics modifiers are a class of programs that allow the development of general and reusable "semantics components". Language independence is achieved through the interpretive approach: an interpreter serves as a mediator between the new language and the language for which the non-standard semantics was implemented. Inverse computation, equivalence transformation and neighborhood analysis are shown to be semantics modifiers. Experiments with these modifiers show the computatio
Gli stili APA, Harvard, Vancouver, ISO e altri
21

RIESCO, ADRIÁN, and JUAN RODRÍGUEZ-HORTALÁ. "Singular and plural functions for functional logic programming." Theory and Practice of Logic Programming 14, no. 1 (May 17, 2012): 65–116. http://dx.doi.org/10.1017/s147106841200004x.

Testo completo
Abstract (sommario):
AbstractModern functional logic programming (FLP) languages use non-terminating and non-confluent constructor systems (CSs) as programs in order to define non-strict and non-deterministic functions. Two semantic alternatives have been usually considered for parameter passing with this kind of functions: call-time choice and run-time choice. While the former is the standard choice of modern FLP languages, the latter lacks some basic properties – mainly compositionality – that have prevented its use in practical FLP systems. Traditionally it has been considered that call-time choice induces a si
Gli stili APA, Harvard, Vancouver, ISO e altri
22

CRUZ, FLAVIO, RICARDO ROCHA, SETH COPEN GOLDSTEIN, and FRANK PFENNING. "A Linear Logic Programming Language for Concurrent Programming over Graph Structures." Theory and Practice of Logic Programming 14, no. 4-5 (July 2014): 493–507. http://dx.doi.org/10.1017/s1471068414000167.

Testo completo
Abstract (sommario):
AbstractWe have designed a new logic programming language called LM (Linear Meld) for programming graph-based algorithms in a declarative fashion. Our language is based on linear logic, an expressive logical system where logical facts can be consumed. Because LM integrates both classical and linear logic, LM tends to be more expressive than other logic programming languages. LM programs are naturally concurrent because facts are partitioned by nodes of a graph data structure. Computation is performed at the node level while communication happens between connected nodes. In this paper, we prese
Gli stili APA, Harvard, Vancouver, ISO e altri
23

Ghica, Dan R. "Regular-Language Semantics for a Call-by-Value Programming Language." Electronic Notes in Theoretical Computer Science 45 (November 2001): 106–18. http://dx.doi.org/10.1016/s1571-0661(04)80958-7.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
24

Zhang, Yudong, Wenhao Zheng, and Ming Li. "Learning Uniform Semantic Features for Natural Language and Programming Language Globally, Locally and Sequentially." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 5845–52. http://dx.doi.org/10.1609/aaai.v33i01.33015845.

Testo completo
Abstract (sommario):
Semantic feature learning for natural language and programming language is a preliminary step in addressing many software mining tasks. Many existing methods leverage information in lexicon and syntax to learn features for textual data. However, such information is inadequate to represent the entire semantics in either text sentence or code snippet. This motivates us to propose a new approach to learn semantic features for both languages, through extracting three levels of information, namely global, local and sequential information, from textual data. For tasks involving both modalities, we p
Gli stili APA, Harvard, Vancouver, ISO e altri
25

Tofte, Mads. "Principal signatures for higher-order program modules." Journal of Functional Programming 4, no. 3 (July 1994): 285–335. http://dx.doi.org/10.1017/s0956796800001088.

Testo completo
Abstract (sommario):
AbstractIn this paper we present a language for programming with higher-order modules. The language HML is based on Standard ML in that it provides structures, signatures and functors. In HML, functors can be declared inside structures and specified inside signatures; this is not possible in Standard ML. We present an operational semantics for the static semantics of HML signature expressions, with particular emphasis on the handling of sharing. As a justification for the semantics, we prove a theorem about the existence of principal signatures. This result is closely related to the existence
Gli stili APA, Harvard, Vancouver, ISO e altri
26

Kaiser, G. E. "Incremental dynamic semantics for language-based programming environments." ACM Transactions on Programming Languages and Systems 11, no. 2 (April 1989): 169–93. http://dx.doi.org/10.1145/63264.63400.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
27

COSTANTINÍ, STEFANIA, and GAETANO AURELIO LANZARONE. "A metalogic programming approach: language, semantics and applications." Journal of Experimental & Theoretical Artificial Intelligence 6, no. 3 (July 1994): 239–87. http://dx.doi.org/10.1080/09528139408953789.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
28

Hudak, Paul. "Denotational semantics of a para-functional programming language." International Journal of Parallel Programming 15, no. 2 (April 1986): 103–25. http://dx.doi.org/10.1007/bf01414441.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
29

Berry, Gérard, and Georges Gonthier. "The Esterel synchronous programming language: design, semantics, implementation." Science of Computer Programming 19, no. 2 (November 1992): 87–152. http://dx.doi.org/10.1016/0167-6423(92)90005-v.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
30

Cruttwell, Geoffrey, Jonathan Gallagher, and Dorette Pronk. "Categorical semantics of a simple differential programming language." Electronic Proceedings in Theoretical Computer Science 333 (February 8, 2021): 289–310. http://dx.doi.org/10.4204/eptcs.333.20.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
31

LASSEN, S. B. "Action semantics reasoning about functional programs." Mathematical Structures in Computer Science 7, no. 5 (October 1997): 557–89. http://dx.doi.org/10.1017/s0960129597002417.

Testo completo
Abstract (sommario):
This paper develops the functional part of a theory of action semantics for reasoning about programs. Action notation, the specification language of action semantics, is given an evaluation semantics, and operational techniques from process theory and functional programming are applied in the development of a versatile action theory. The power of the theory is demonstrated by means of action semantic proofs of functional program equivalences.
Gli stili APA, Harvard, Vancouver, ISO e altri
32

Silbermann, Frank S. K., and Bharat Jayaraman. "A domain-theoretic approach to functional and logic programming." Journal of Functional Programming 2, no. 3 (July 1992): 273–321. http://dx.doi.org/10.1017/s095679680000040x.

Testo completo
Abstract (sommario):
AbstractThe integration of functional and logic programming languages has been a topic of great interest in the last decade. Many proposals have been made, yet none is completely satisfactory especially in the context of higher order functions and lazy evaluation. This paper addresses these shortcomings via a new approach: domain theory as a common basis for functional and logic programming. Our integrated language remains essentially within the functional paradigm. The logic programming capability is provided by set abstraction (via Zermelo-Frankel set notation), using the Herbrand universe a
Gli stili APA, Harvard, Vancouver, ISO e altri
33

BOUDOL, GÉRARD. "The recursive record semantics of objects revisited." Journal of Functional Programming 14, no. 3 (April 14, 2004): 263–315. http://dx.doi.org/10.1017/s0956796803004775.

Testo completo
Abstract (sommario):
In a call-by-value language, representing objects as recursive records requires using an unsafe fixpoint. We design, for a core language including extensible records, a type system which rules out unsafe recursion and still supports the construction of a principal type for each typable term. We illustrate the expressive power of this language with respect to object-oriented programming by introducing a sub-language for “mixin-based” programming.
Gli stili APA, Harvard, Vancouver, ISO e altri
34

WEIRICH, STEPHANIE. "Type-safe run-time polytypic programming." Journal of Functional Programming 16, no. 6 (February 28, 2006): 681–710. http://dx.doi.org/10.1017/s0956796806005879.

Testo completo
Abstract (sommario):
Polytypic programming is a way of defining type-indexed operations, such as map, fold and zip, based on type information. Run-time polytypic programming allows that type information to be dynamically computed – this support is essential in modern programming languages that support separate compilation, first-class type abstraction, or polymorphic recursion. However, in previous work we defined run-time polytypic programming with a type-passing semantics. Although it is natural to define polytypic programs as operating over first-class types, such a semantics suffers from a number of drawbacks.
Gli stili APA, Harvard, Vancouver, ISO e altri
35

Vieira, R., A. F. Moreira, M. Wooldridge, and R. H. Bordini. "On the Formal Semantics of Speech-Act Based Communication in an Agent-Oriented Programming Language." Journal of Artificial Intelligence Research 29 (June 30, 2007): 221–67. http://dx.doi.org/10.1613/jair.2221.

Testo completo
Abstract (sommario):
Research on agent communication languages has typically taken the speech acts paradigm as its starting point. Despite their manifest attractions, speech-act models of communication have several serious disadvantages as a foundation for communication in artificial agent systems. In particular, it has proved to be extremely difficult to give a satisfactory semantics to speech-act based agent communication languages. In part, the problem is that speech-act semantics typically make reference to the "mental states" of agents (their beliefs, desires, and intentions), and there is in general no way t
Gli stili APA, Harvard, Vancouver, ISO e altri
36

LE, VAN HUNG, FEI LIU, and DINH KHANG TRAN. "Fuzzy linguistic logic programming and its applications." Theory and Practice of Logic Programming 9, no. 3 (May 2009): 309–41. http://dx.doi.org/10.1017/s1471068409003779.

Testo completo
Abstract (sommario):
AbstractThe paper introduces fuzzy linguistic logic programming, which is a combination of fuzzy logic programming, introduced by P. Vojtáš, and hedge algebras in order to facilitate the representation and reasoning on human knowledge expressed in natural languages. In fuzzy linguistic logic programming, truth values are linguistic ones, e.g., VeryTrue, VeryProbablyTrue and LittleFalse, taken from a hedge algebra of a linguistic truth variable, and linguistic hedges (modifiers) can be used as unary connectives in formulae. This is motivated by the fact that humans reason mostly in terms of lin
Gli stili APA, Harvard, Vancouver, ISO e altri
37

Lifschitz, Vladimir. "Answer Sets and the Language of Answer Set Programming." AI Magazine 37, no. 3 (October 7, 2016): 7–12. http://dx.doi.org/10.1609/aimag.v37i3.2670.

Testo completo
Abstract (sommario):
Answer set programming is a declarative programming paradigm based on the answer set semantics of logic programs. This introductory article provides the mathematical background for the discussion of answer set programming in other contributions to this special issue.
Gli stili APA, Harvard, Vancouver, ISO e altri
38

Cho, Kenta. "Semantics for a Quantum Programming Language by Operator Algebras." Electronic Proceedings in Theoretical Computer Science 172 (December 28, 2014): 165–90. http://dx.doi.org/10.4204/eptcs.172.12.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
39

PLAICE, JOHN A. "The LUSTRE Synchronous Dataflow Programming Language: Design and Semantics." Annals of the New York Academy of Sciences 661, no. 1 Frontiers of (December 1992): 118–51. http://dx.doi.org/10.1111/j.1749-6632.1992.tb26038.x.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
40

Cho, Kenta. "Semantics for a Quantum Programming Language by Operator Algebras." New Generation Computing 34, no. 1-2 (March 2016): 25–68. http://dx.doi.org/10.1007/s00354-016-0204-3.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
41

Saint-Dizier, Patrick. "An approach to natural-language semantics in logic programming." Journal of Logic Programming 3, no. 4 (December 1986): 329–56. http://dx.doi.org/10.1016/0743-1066(86)90010-5.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
42

Mihelic, Jurij, William Steingartner, and Valerie Novitzká. "A denotational semantics of a concatenative/compositional programming language." Acta Polytechnica Hungarica 18, no. 4 (2021): 231–50. http://dx.doi.org/10.12700/aph.18.4.2021.4.13.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
43

De Silva, Lavindra. "An Operational Semantics for True Concurrency in BDI Agent Systems." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 05 (April 3, 2020): 7119–26. http://dx.doi.org/10.1609/aaai.v34i05.6199.

Testo completo
Abstract (sommario):
Agent programming languages have proved useful for formally modelling implemented systems such as PRS and JACK, and for reasoning about their behaviour. Over the past decades, many agent programming languages and extensions have been developed. A key feature in some of them is their support for the specification of ‘concurrent’ actions and programs. However, their notion of concurrency is still limited, as it amounts to a nondeterministic choice between (sequential) action interleavings. Thus, the notion does not represent ‘true concurrency’, which can more naturally exploit multi-core compute
Gli stili APA, Harvard, Vancouver, ISO e altri
44

CLARK, DAVID, ROBERTO GIACOBAZZI, and CHUNYAN MU. "Foreword: programming language interference and dependence." Mathematical Structures in Computer Science 21, no. 6 (October 27, 2011): 1109–10. http://dx.doi.org/10.1017/s0960129511000168.

Testo completo
Abstract (sommario):
Interference and dependence are closely related concepts: interference being the observable phenomenon connected with dependence. Essentially, interference means that the behaviour of some parts of a dynamic system may influence the behaviour of other parts of the same system, while dependence specifies how the semantics of sub-components of a dynamic system are related. Identifying, measuring and controlling interference is essential in many aspects of modern computer science, in particular, in security, program analysis and verification, debugging, systems specification, model checking, prog
Gli stili APA, Harvard, Vancouver, ISO e altri
45

Yang, Zheng, and Hang Lei. "Lolisa: Formal Syntax and Semantics for a Subset of the Solidity Programming Language in Mathematical Tool Coq." Mathematical Problems in Engineering 2020 (November 30, 2020): 1–15. http://dx.doi.org/10.1155/2020/6191537.

Testo completo
Abstract (sommario):
The security of blockchain smart contracts is one of the most emerging issues of the greatest interest for researchers. This article presents an intermediate specification language for the formal verification of Ethereum-based smart contract in Coq, denoted as Lolisa. The formal syntax and semantics of Lolisa contain a large subset of the Solidity programming language developed for the Ethereum blockchain platform. To enhance type safety, the formal syntax of Lolisa adopts a stronger static type system than Solidity. In addition, Lolisa includes a large subset of Solidity syntax components as
Gli stili APA, Harvard, Vancouver, ISO e altri
46

Bryant, Barrett, Jeff Gray, Marjan Mernik, Peter Clarke, Robert France, and Gabor Karsai. "Challenges and directions in formalizing the semantics of modeling languages." Computer Science and Information Systems 8, no. 2 (2011): 225–53. http://dx.doi.org/10.2298/csis110114012b.

Testo completo
Abstract (sommario):
Developing software from models is a growing practice and there exist many model-based tools (e.g., editors, interpreters, debuggers, and simulators) for supporting model-driven engineering. Even though these tools facilitate the automation of software engineering tasks and activities, such tools are typically engineered manually. However, many of these tools have a common semantic foundation centered around an underlying modeling language, which would make it possible to automate their development if the modeling language specification were formalized. Even though there has been much work in
Gli stili APA, Harvard, Vancouver, ISO e altri
47

MAY, WOLFGANG. "XPath-logic and XPathLog: A logic-programming style XML data manipulation language." Theory and Practice of Logic Programming 4, no. 3 (April 16, 2004): 239–87. http://dx.doi.org/10.1017/s147106840300187x.

Testo completo
Abstract (sommario):
We define XPathLog as a Datalog-style extension of XPath. XPathLog provides a clear, declarative language for querying and manipulating XML whose perspectives are especially in XML data integration. In our characterization, the formal semantics is defined wrt. an edge-labeled graph-based model, which covers the XML data model. We give a complete, logic-based characterization of XML data and the main language concept for XML, XPath. XPath-Logic extends the XPath language with variable bindings and embeds it into first-order logic. XPathLog is then the Horn fragment of XPath-Logic, providing a D
Gli stili APA, Harvard, Vancouver, ISO e altri
48

NISHIMURA, SUSUMU, and ATSUSHI OHORI. "Parallel functional programming on recursively defined data via data-parallel recursion." Journal of Functional Programming 9, no. 4 (July 1999): 427–62. http://dx.doi.org/10.1017/s0956796899003457.

Testo completo
Abstract (sommario):
This article proposes a new language mechanism for data-parallel processing of dynamically allocated recursively defined data. Different from the conventional array-based data- parallelism, it allows parallel processing of general recursively defined data such as lists or trees in a functional way. This is achieved by representing a recursively defined datum as a system of equations, and defining new language constructs for parallel transformation of a system of equations. By integrating them with a higher-order functional language, we obtain a functional programming language suitable for desc
Gli stili APA, Harvard, Vancouver, ISO e altri
49

Seidman, Robert H. "Computer Programming and Logical Reasoning: Unintended Cognitive Effects." Journal of Educational Technology Systems 18, no. 2 (December 1989): 123–41. http://dx.doi.org/10.2190/myuy-g56t-226t-pvt0.

Testo completo
Abstract (sommario):
Recent research results having to do with explicit instruction in computer programming and cognitive skills indicate an increased emphasis upon the structure of the learning environment surrounding programming languages. A new research direction concerned with transfer effects due to environmental aspects of programming instruction is emerging. A conceptual analysis of the syntax and semantics of the IF-THEN [ELSE] conditional command is presented which suggests that mastering a procedural language itself (independent of environment) might have unintended, indirect, and potentially negative ef
Gli stili APA, Harvard, Vancouver, ISO e altri
50

El-Zawawy, Mohamed A. "Testing Automation of Context-Oriented Programs Using Separation Logic." Applied Computational Intelligence and Soft Computing 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/930186.

Testo completo
Abstract (sommario):
A new approach for programming that enables switching among contexts of commands during program execution is context-oriented programming (COP). This technique is more structured and modular than object-oriented and aspect-oriented programming and hence more flexible. For context-oriented programming, as implemented in COP languages such as ContextJ*and ContextL, this paper introduces accurate operational semantics. The language model of this paper uses Java concepts and is equipped with layer techniques for activation/deactivation of layer contexts. This paper also presents a logical system f
Gli stili APA, Harvard, Vancouver, ISO e altri
Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!