Filters








76,295 Hits in 3.4 sec

FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION

KRYSTIAN DUDZINSKI, STAVROS KONSTANTINIDIS
2012 International Journal of Foundations of Computer Science  
We also present an initial implementation of a LAnguage SERver capable of deciding the satisfaction problem for a given transducer code property and regular language.  ...  The method provides simple and uniform decision procedures for the basic questions of property satisfaction and maximality for regular languages.  ...  LAnguage SERver Here we give a brief description of the architecture, current functionality and user interface of a web server for deciding the satisfaction problem about given languages and code properties  ... 
doi:10.1142/s0129054112400059 fatcat:vwzicazndzcdxfyauewxxeynvu

Efficient Regular Language Search for Secure Cloud Storage

Karthikeyan B, Vishaal S, Ajithkumar P
2019 IJARCCE  
A notable highlight of the proposal over other existing schemes is that it supports the regular language encryption and deterministic finite automata (DFA) based data retrieval.  ...  In this paper, we propose an efficient large universe regular language search scheme for the cloud storage, which privacy is preserving and secure against the off-line keyword guessing attack (KGA).  ...  data and convert the data's into regular language and display those information to authorized user whenever they need.  ... 
doi:10.17148/ijarcce.2019.8243 fatcat:7ly3gbyos5h6dchsltye6y5pb4

A XML Based Datagrid Description Language [article]

Rene Felder, Erich Schikuta
2016 arXiv   pre-print
Our framework is based on the portable XML language and allows to store syntactical and semantical information together with arbitrary files.  ...  We present xDGDL, an approach towards a concise but comprehensive Datagrid description language.  ...  Example of a regular distributed file onto 2 servers.  ... 
arXiv:1607.05922v1 fatcat:cr5eauu7h5hh7mhubnxxocqvza

Obvious or not?

Mati Shomrat, Amiram Yehudai
2002 Proceedings of the 1st international conference on Aspect-oriented software development - AOSD '02  
We explore the possibility of using Aspect-Oriented Programming in general and the AspectJ programming language in particular for the enforcement of design models.  ...  The essence of the problem of enforcing such models lies in their globality.  ...  There are problems with the demand for extending the language since the general tendency is to keep programming languages concise and to prevent cluttering. Where do we draw the line?  ... 
doi:10.1145/508386.508388 dblp:conf/aosd/ShomratY02 fatcat:37voe3q65ffjphpkownf2ebwvq

Obvious or not?

Mati Shomrat, Amiram Yehudai
2002 Proceedings of the 1st international conference on Aspect-oriented software development - AOSD '02  
We explore the possibility of using Aspect-Oriented Programming in general and the AspectJ programming language in particular for the enforcement of design models.  ...  The essence of the problem of enforcing such models lies in their globality.  ...  There are problems with the demand for extending the language since the general tendency is to keep programming languages concise and to prevent cluttering. Where do we draw the line?  ... 
doi:10.1145/508387.508388 fatcat:koiybwf27jeezekpbyvq6nqw2m

Lang-n-Send Extended: Sending Regular Expressions to Monitors

Matteo Cimini
2022 Electronic Proceedings in Theoretical Computer Science  
Next, we extend Lang-n-Send with monitors and with the ability of sending and receiving regular expressions, which then can be used in the context of larger regular expressions to monitor the execution  ...  In prior work, Cimini has presented Lang-n-Send, a pi-calculus with language definitions. In this paper, we present an extension of this calculus called Lang-n-Send+m.  ...  The inclusion problem is decidable for regular expressions [21] .  ... 
doi:10.4204/eptcs.365.5 fatcat:c3velagixndxhdr747k24rbfxy

The Computer Scientist Nightmare [chapter]

Manuel Serrano
2016 Lecture Notes in Computer Science  
The Hop syntax is defined by a regular language. It can then be parsed efficiently by a finite state automaton such as those generated by the Hop form "regular-grammar".  ...  Clearly the C functions strtod and atof have a peculiar design that is partly responsible for the problem.  ... 
doi:10.1007/978-3-319-30936-1_19 fatcat:ze5a5r7oq5dptjmyojr65h66ry

Freezing the Web: A Study of ReDoS Vulnerabilities in JavaScript-based Web Servers

Cristian-Alexandru Staicu, Michael Pradel
2018 USENIX Security Symposium  
the ConcSys and Perf4JS projects, and by the Hessian LOEWE initiative within the Software-Factory 4.0 project.  ...  Acknowledgments This work was supported by the German Federal Ministry of Education and Research and by the Hessian Ministry of Science and the Arts within CRISP, by the German Research Foundation within  ...  Most implementations in modern programming languages address this problem by converting the regular expression into an automaton [38] and through a backtracking-based search for a sequence of transitions  ... 
dblp:conf/uss/StaicuP18 fatcat:zmnnzjp2hranlpnchabqoxmmcu

New technologies for rapid development of Web orientated database applications

Nick Hatzigeorgiu, Apostolos Syropoulos
1999 ACM SIGCUE Outlook  
We describe some of these new technologies and we briefly present two examples showing how we can use these technologies in real world applications.  ...  HTML is an interpreted markup language based on tags within regular ASCII text. The Web browser contains an interpreter for this language and a viewer for the resulting formatted text.  ...  However, this simplicity is also the major problem in developing Web applications. Some of the original handicaps are HTML is a markup language, not a programming language.  ... 
doi:10.1145/308689.308702 fatcat:kwmzrq2mlrewvbqgmokbqgb2ly

Improving the predictable assembly of service-oriented architectures

B.A. Malloy, N.A. Kraft, J.O. Hallstrom, J.M. Voas
2006 IEEE Software  
These issues represent a wide class of common formatting problems and are precisely the problems we wish to address.  ...  This round trip to the server incurred a performance penalty on both the client and the server. Detecting the formatting error on the client side avoids this penalty.  ... 
doi:10.1109/ms.2006.49 fatcat:hkdpuwrofjebxb72sqnqnepfci

Page 3873 of Mathematical Reviews Vol. , Issue 98F [page]

1998 Mathematical Reviews  
(H-SZEG-FC; Szeged) Server problems and regular languages. (English summary) Acta Cybernet. 13 (1997), no. 1, 23-39.  ...  We assume that the server problem is restricted, meaning that the request words are chosen from a sub- set of all possible words, i.e. from a language.  ... 

Multitier Programming in Hop

Manuel Serrano, Gérard Berry
2012 Queue  
JavaScript is the dominant Web language but was conceived as a browser-only client language. Servers are usually programmed with quite different languages such as Java, PHP, and Ruby.  ...  They all proposed that a Web application should be programmed as a single code for the server and the client, and written in a single unified language.  ...  This simple problem illustrates the most central aspect of realistic Web applications-namely, the tight collaboration and synchronization of servers and clients.  ... 
doi:10.1145/2330087.2330089 fatcat:wtqwfyftfzcabeffxbsyiu554i

Decidable and Expressive Classes of Probabilistic Automata [chapter]

Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan, Yue Ben
2015 Lecture Notes in Computer Science  
We prove that these decision problems are also PSPACE-hard. Next, we present a new sufficient condition when 1-level HPAs recognize regular languages (in both the finite and infinite cases).  ...  We show that even though 1-level HPAs with threshold 1/2 are very expressive (in that they recognize non-regular languages), the non-emptiness and non-universality problems are both decidable in EXPTIME  ...  Prasad Sistla and Yue Ben were paritally supported by CNS 1035914, CCF 1319754 and CNS 1314485.  ... 
doi:10.1007/978-3-662-46678-0_13 fatcat:7tefdhpeajbpphrxynqpijfks4

Book Reviews

Edward J. Valauskas, Dan Marmion, James Hodson, Tim Eisler
1997 First Monday  
The use of a regular expression in the Awk, Tcl, Perl, and Python scripting languages and in the vi and GNU Emacs editor are discussed.  ...  Later, with a larger assignment and with this Mastering Regular Expressions , I was able to write a Perl script to handle the problem in half an hour.  ... 
doi:10.5210/fm.v2i6.534 fatcat:eo36icxf3bfarepvhjnyqyvj6y

Automated Instruction-Set Randomization for Web Applications in Diversified Redundant Systems

Frédéric Majorczyk, Jonathan-Christofer Demay
2009 2009 International Conference on Availability, Reliability and Security  
Our solution consists in creating diversity in the web application scripts by randomizing the language understood by the interpreter so that an injected code can not be executed by all the servers.  ...  These architectures are based on the architecture of N-version programming and were often instantiated for web servers without taking into account the web application(s) running on those.  ...  Like in the simple automated process, we use a heuristic based on regular expressions to determine the language in each string.  ... 
doi:10.1109/ares.2009.64 dblp:conf/IEEEares/MajorczykD09 fatcat:y7tgnq2d3femjfzfd3iiwbccmi
« Previous Showing results 1 — 15 out of 76,295 results